Sciweavers

46 search results - page 8 / 10
» Efficient k-NN search on vertically decomposed data
Sort
View
SODA
2004
ACM
116views Algorithms» more  SODA 2004»
13 years 7 months ago
Retroactive data structures
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
Erik D. Demaine, John Iacono, Stefan Langerman
CVPR
2007
IEEE
14 years 7 months ago
Optimal Step Nonrigid ICP Algorithms for Surface Registration
We show how to extend the ICP framework to nonrigid registration, while retaining the convergence properties of the original algorithm. The resulting optimal step nonrigid ICP fra...
Brian Amberg, Sami Romdhani, Thomas Vetter
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
14 years 5 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
ICAPR
2001
Springer
13 years 10 months ago
Image Retrieval Using a Hierarchy of Clusters
The goal of this paper is to describe an efficient procedure for color-based image retrieval. The proposed procedure consists of two stages. First, the image data set is hierarchi...
Daniela Stan, Ishwar K. Sethi
ICPR
2002
IEEE
14 years 6 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang