Sciweavers

194 search results - page 11 / 39
» Computing Distance Histograms Efficiently in Scientific Data...
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 9 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
JODL
2000
175views more  JODL 2000»
13 years 8 months ago
SPIRE: a digital library for scientific information
In this paper we describe the architecture and implementation of a digital library framework for scientific data, particularly imagery, with a focus on support for content-based se...
Lawrence D. Bergman, Vittorio Castelli, Chung-Shen...
ICPR
2002
IEEE
14 years 10 months ago
Metric-Based Shape Retrieval in Large Databases
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
Thomas B. Sebastian, Benjamin B. Kimia
CVPR
2004
IEEE
14 years 11 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
JIIS
2002
141views more  JIIS 2002»
13 years 8 months ago
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...