Sciweavers

101 search results - page 9 / 21
» Processing Complex Similarity Queries with Distance-Based Ac...
Sort
View
DEXA
2003
Springer
193views Database» more  DEXA 2003»
14 years 20 days ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
BTW
2009
Springer
133views Database» more  BTW 2009»
13 years 10 months ago
High-Dimensional Indexing for Multimedia Features
Abstract: Efficient content-based similarity search in large multimedia databases requires efficient query processing algorithms for many practical applications. Especially in hi...
Ira Assent, Stephan Günnemann, Hardy Kremer, ...
SEBD
1997
158views Database» more  SEBD 1997»
13 years 8 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...
SPIESR
2004
118views Database» more  SPIESR 2004»
13 years 8 months ago
New method for visual descriptor evaluation
Evaluation in visual information retrieval is usually performed by executing test queries and calculating recall and precision based on predefined media collections and ground tru...
Horst Eidenberger
ICIP
2004
IEEE
14 years 9 months ago
Feature statistical retrieval applied to content-based copy identification
In many image or video retrieval systems, the search of similar objects in the database includes a spatial access method to a multidimensional feature space. This step is generall...
Alexis Joly, Carl Frélicot, Olivier Buisson