214 search results - page 39 / 43 » Fast Nearest Neighbor Search in High-Dimensional Space |
127
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
CVPR
2009
IEEE
16 years 3 months ago
2009
IEEE
Boosted one-versus-all (OVA) classifiers are commonly used in multiclass problems, such as generic object recognition, biometrics-based identification, or gesture recognition. Join...
AAAI
1998
14 years 10 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
The skyline of a set of d-dimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerabl...