611 search results - page 9 / 123 » Querying Tree-Structured Data Using Dimension Graphs |
125
click to vote
SBBD
2001
15 years 3 months ago
2001
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...
155
click to vote
ALENEX
2001
15 years 3 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
141
click to vote
SISAP
2008
IEEE
15 years 8 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
88
Voted
COLT
2004
Springer
15 years 7 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
148
Voted
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...