112 search results - page 12 / 23 » Succinct Data Structures for Retrieval and Approximate Membe... |
ACSC
2006
IEEE
15 years 4 months ago
2006
IEEE
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
189
click to vote
ICDE
2000
IEEE
15 years 11 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
CVPR
2010
IEEE
14 years 9 months ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
178
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...
TKDE
2010
14 years 8 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...