Sciweavers

233 search results - page 1 / 47
» An Investigation of Practical Approximate Nearest Neighbor A...
Sort
View
NIPS
2004
14 years 6 days ago
An Investigation of Practical Approximate Nearest Neighbor Algorithms
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...
JCIT
2010
148views more  JCIT 2010»
13 years 5 months ago
Investigating the Performance of Naive- Bayes Classifiers and K- Nearest Neighbor Classifiers
Probability theory is the framework for making decision under uncertainty. In classification, Bayes' rule is used to calculate the probabilities of the classes and it is a bi...
Mohammed J. Islam, Q. M. Jonathan Wu, Majid Ahmadi...
FOCS
2006
IEEE
14 years 4 months ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Alexandr Andoni, Piotr Indyk
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
14 years 5 days ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
14 years 5 days ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu