80 search results - page 10 / 16 » Nearest Neighbor Search Using Additive Binary Tree |
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
We present the design and analysis of a customized access method for the content-based image retrieval system, Blobworld. Using the amdb access method analysis tool, we analyzed t...
AAAI
2012
11 years 10 months ago
2012
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
TRECVID
2008
13 years 9 months ago
2008
This paper reports our experiments for TRECVID 2008 tasks: high level feature extraction, search and contentbased copy detection. For the high level feature extraction task, we use...