Sciweavers

68 search results - page 7 / 14
» Distributed similarity search in high dimensions using local...
Sort
View
CSB
2005
IEEE
125views Bioinformatics» more  CSB 2005»
15 years 3 months ago
On Optimizing Distance-Based Similarity Search for Biological Databases
Similarity search leveraging distance-based index structures is increasingly being used for both multimedia and biological database applications. We consider distance-based indexi...
Rui Mao, Weijia Xu, Smriti R. Ramakrishnan, Glen N...
IPPS
2007
IEEE
15 years 4 months ago
High Performance Database Searching with HMMer on FPGAs
1 Profile Hidden Markov Models (profile HMMs) are used as a popular bioinformatics tool for sensitive database searching, e.g. a set of not annotated protein sequences is compared...
Timothy F. Oliver, Leow Yuan Yeow, Bertil Schmidt
JMLR
2010
111views more  JMLR 2010»
14 years 4 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
ECCV
2010
Springer
15 years 2 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
15 years 11 months ago
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
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...
Bernd-Uwe Pagel, Flip Korn, Christos Faloutsos