435 search results - page 9 / 87 » Partitioning Search Spaces of a Randomized Search |
116
click to vote
ERSHOV
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data. These methods sele...
127
click to vote
STOC
1998
ACM
15 years 1 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
We present an algorithm to reduce per-pixel search ranges for Markov Random Fields-based stereo algorithms. Our algorithm is based on the intuitions that reliably matched pixels ne...
DKE
2002
14 years 9 months ago
2002
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...