133 search results - page 18 / 27 » Approximation bounds for Black Hole Search problems |
119
click to vote
SIGMOD
2010
ACM
15 years 4 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...
114
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
191
click to vote
SIGMOD
2006
ACM
15 years 11 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
102
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
UAI
2003
15 years 1 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...