Sciweavers

133 search results - page 18 / 27
» Efficient multi-step query processing for EMD-based similari...
Sort
View
ICIP
2002
IEEE
14 years 9 months ago
A new and simple shape descriptor based on a non-parametric multiscale model
In this paper, we present a new and robust shape descriptor, which can be efficiently used to quickly prune a search for similar shapes in a large image database. The proposed sha...
Max Mignotte
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 9 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 9 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 9 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
PVLDB
2008
128views more  PVLDB 2008»
13 years 7 months ago
Hexastore: sextuple indexing for semantic web data management
Despite the intense interest towards realizing the Semantic Web vision, most existing RDF data management schemes are constrained in terms of efficiency and scalability. Still, th...
Cathrin Weiss, Panagiotis Karras, Abraham Bernstei...