169 search results - page 1 / 34 » Reductions among high dimensional proximity problems |
SODA
2001
ACM
13 years 6 months ago
2001
ACM
SODA
2000
ACM
13 years 6 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
MICAI
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
ICDE
2003
IEEE
14 years 6 months ago
2003
IEEE
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
ICDE
2007
IEEE
13 years 11 months ago
2007
IEEE
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...