92 search results - page 13 / 19 » Quality and efficiency in high dimensional nearest neighbor ... |
127
click to vote
VLDB
1999
ACM
15 years 1 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
105
click to vote
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
BMCBI
2008
14 years 9 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...