73 search results - page 2 / 15 » Hashing Tree-Structured Data: Methods and Applications |
ECCV
2010
Springer
13 years 10 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—Network applications often require large data storage resources, fast queries, and frequent updates. Hash tables support these operations with low costs, yet they cannot...
PARBASE
1990
13 years 6 months ago
1990
This paper presents a vectorized algorithm for entering data into a hash table. A program that enters multiple data could not be executed on vector processors by conventional vect...
SIGIR
2012
ACM
11 years 7 months ago
2012
ACM
Similarity search is a key challenge for multimedia retrieval applications where data are usually represented in high-dimensional space. Among various algorithms proposed for simi...
TPDS
1998
13 years 4 months ago
1998
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...