Sciweavers

330 search results - page 35 / 66
» Supporting Similarity Queries in MARS
Sort
View
AI
2010
Springer
13 years 10 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
ISAAC
2007
Springer
156views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Approximate Range Searching in External Memory
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
Micha Streppel, Ke Yi
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 11 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
MMM
2007
Springer
107views Multimedia» more  MMM 2007»
14 years 4 months ago
Hierarchical Indexing Structure for 3D Human Motions
Content-based retrieval of 3D human motion capture data has significant impact in different fields such as physical medicine, rehabilitation, and animation. This paper develops ...
Gaurav N. Pradhan, Chuanjun Li, Balakrishnan Prabh...
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
14 years 2 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel