4463 search results - page 826 / 893 » computing 2000 |
105
click to vote
EDBT
2000
ACM
15 years 3 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
86
Voted
ICPR
2000
IEEE
16 years 3 days ago
2000
IEEE
We consider di usion processes on a class of R trees. The processes are de ned in a manner similar to that of Le Gall's Brownian snake. Each point in the tree has a real value...
SMILE
2000
Springer
15 years 2 months ago
2000
Springer
Brute-forcedensematchingisusuallynotsatisfactorybecausethesame search range is used for the entire image, yielding potentially many false matches. In this paper, we propose a progr...
CVPR
2000
IEEE
16 years 1 months ago
2000
IEEE
This paper proposes a novel hypergraph skeletal representation for 3D shape based on a formal derivation of the generic structure of its medial axis. By classifying each skeletal ...
CVPR
2000
IEEE
16 years 1 months ago
2000
IEEE
Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared di erences ...