Sciweavers

59 search results - page 10 / 12
» The Many Facets of Approximate Similarity Search
Sort
View
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 6 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
14 years 6 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 4 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
CIKM
2001
Springer
13 years 10 months ago
Content-Based Retrieval of MP3 Music Objects
In recent years, the searching and indexing techniques for multimedia data are getting more attention in the area of multimedia databases. As many research works were done on the ...
Chih-Chin Liu, Po-Jun Tsai
SDM
2007
SIAM
145views Data Mining» more  SDM 2007»
13 years 7 months ago
Finding Motifs in a Database of Shapes
The problem of efficiently finding images that are similar to a target image has attracted much attention in the image processing community and is rightly considered an informatio...
Xiaopeng Xi, Eamonn J. Keogh, Li Wei, Agenor Mafra...