Sciweavers

89 search results - page 3 / 18
» Indexing Metric Spaces with M-Tree
Sort
View
PODS
1998
ACM
152views Database» more  PODS 1998»
14 years 1 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
EDBT
2011
ACM
225views Database» more  EDBT 2011»
13 years 8 days ago
On (not) indexing quadratic form distance by metric access methods
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
Tomás Skopal, Tomás Bartos, Jakub Lo...
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
13 years 7 months ago
CP-index: using clustering and pivots for indexing non-metric spaces
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
Victor Sepulveda, Benjamin Bustos
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 8 months ago
Dirac Notation, Fock Space and Riemann Metric Tensor in Information Retrieval Models
Using Dirac Notation as a powerful tool, we investigate the three classical Information Retrieval (IR) models and some their extensions. We show that almost all such models can be...
Xing M. Wang
CIARP
2009
Springer
14 years 2 days ago
A Brief Index for Proximity Searching
A large number of computer tasks can be modeled as the search for an object near a given query. From multimedia databases to learning algorithms, data mining and pattern recognitio...
Eric Sadit Tellez, Edgar Chávez, Antonio Ca...