120 search results - page 22 / 24 » Complementary Hashing for Approximate Nearest Neighbor Searc... |
122
click to vote
CIKM
2000
Springer
15 years 7 months ago
2000
Springer
With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based techniqu...
206
click to vote
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
A new data structure for efficient similarity search in very large datasets of high-dimensional vectors is introduced. This structure called the inverted multi-index generalizes ...
133
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
128
click to vote
PVLDB
2008
15 years 2 months ago
2008
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
149
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...