50 search results - page 4 / 10 » NNH: Improving Performance of Nearest-Neighbor Searches Usin... |
COMPGEOM
2006
ACM
14 years 29 days ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
IWANN
2011
Springer
12 years 10 months ago
2011
Springer
In recent years, the increasing interest in fuzzy rough set theory has allowed the definition of novel accurate methods for feature selection. Although their stand-alone applicati...
ECCV
2010
Springer
14 years 6 days ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
TMI
2010
13 years 1 months ago
2010
Abstract--We aim at improving quantitative measures of emphysema in computed tomography (CT) images of the lungs. Current standard measures, such as the relative area of emphysema ...
SIGMOD
2010
ACM
13 years 11 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...