H. T. Kung
- 1 KNUTH, D.E The Art of Computer Programming, Vol 8: Sorting and Searchzng. Addison-Wesley, Readmng, Mass, 1973 Google Scholar
- 2 KUNG, H .T . On the computational complexity of finding the mamma of a set of vectors Proc 15th Annual IEEE Syrup. on Switching and Automata Theory, Oct. 1974, pp. 117-121 (also available as a Comput. Scl Dep. Rep, Carnegm-Mellon U , Pittsburgh, Pa , April 1974).Google Scholar
- 3 LUCCIO, F., AND PREPARATA, F .P . Oil finding the maxima of a set of vectors. Istituto di Scienze dell'Informazione, UniversitA di Pisa, 56100 Pisa, Italy, Dec. 1973Google Scholar
- 4 YAO, F. F On finding the maximal elements in a set of plane vectors Comput. Sci. Dep Rep, U. of Illinois at Urbana- Champaign, Urbana, Ill., July 1974.Google Scholar
Index Terms
- On Finding the Maxima of a Set of Vectors
Recommendations
Reducing SVR Support Vectors by Using Backward Deletion
KES '08: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part IIISupport Vector Regression (SVR) is one of the most famous sparse kernel machines which inherits many advantages of Support Vector Machines (SVM). However, since the number of support vectors grows rapidly with the increase of training samples, ...
A new coding-based algorithm for finding closest pair of vectors
AbstractGiven n vectors x 0 , x 1 , … , x n − 1 in { 0 , 1 } m, how to find two vectors whose pairwise Hamming distance is minimum? This problem is known as the Closest Pair Problem. If these vectors are generated uniformly at random except ...
A Hamming Maxnet That Determines all the Maxima
SETN '08: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and ApplicationsIn this paper the problem of the determination of the maximum among the M members of a set of positive real numbers S is considered. More specifically, a version of the Hamming Maxnet is proposed that is able to determine all maxima of S , in ...
Comments