Sciweavers

10 search results - page 1 / 2
» PL2AP: fast parallel cosine similarity search
Sort
View
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
13 years 9 months ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
VLDB
2001
ACM
92views Database» more  VLDB 2001»
13 years 9 months ago
Fast Evaluation Techniques for Complex Similarity Queries
Complex similarity queries, i.e., multi-feature multi-object queries, are needed to express the information need of a user against a large multimedia repository. Even if a user in...
Klemens Böhm, Michael Mlivoncic, Hans-Jö...
IPPS
2002
IEEE
13 years 9 months ago
A Prototypical Self-Optimizing Package for Parallel Implementation of Fast Signal Transforms
This paper presents a self-adapting parallel package for computing the Walsh-Hadamard transform (WHT), a prototypical fast signal transform, similar to the fast Fourier transform....
Kang Chen, Jeremy R. Johnson
WWW
2005
ACM
14 years 5 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan
BMCBI
2010
122views more  BMCBI 2010»
13 years 5 months ago
Fast and accurate protein substructure searching with simulated annealing and GPUs
Background: Searching a database of protein structures for matches to a query structure, or occurrences of a structural motif, is an important task in structural biology and bioin...
Alex Stivala, Peter J. Stuckey, Anthony Wirth