Sciweavers

259 search results - page 21 / 52
» Clustering for Approximate Similarity Search in High-Dimensi...
Sort
View
CVPR
2005
IEEE
15 years 11 months ago
Efficient Image Matching with Distributions of Local Invariant Features
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
Kristen Grauman, Trevor Darrell
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
15 years 1 months ago
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
Eamonn J. Keogh, Michael J. Pazzani
BCB
2010
126views Bioinformatics» more  BCB 2010»
14 years 4 months ago
Functional similarities of reaction sets in metabolic pathways
Analyzing metabolic pathways by means of their steady states has proven to be accurate and efficient for practical purposes. The models such as elementary flux modes (EFMs) and ex...
Ferhat Ay, Tamer Kahveci
MM
2005
ACM
122views Multimedia» more  MM 2005»
15 years 3 months ago
Image clustering with tensor representation
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
Xiaofei He, Deng Cai, Haifeng Liu, Jiawei Han
76
Voted
ICPP
2008
IEEE
15 years 4 months ago
Bounded LSH for Similarity Search in Peer-to-Peer File Systems
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...
Yu Hua, Bin Xiao, Dan Feng, Bo Yu