Sciweavers

2157 search results - page 282 / 432
» Optimal Fast Hashing
Sort
View
ISBI
2004
IEEE
16 years 4 months ago
Multi-Modal Non-Rigid Registration Using a Stochastic Gradient Approximation
We present a new fast implementation of a non-rigid registration algorithm, based on a finite element elastic deformation model using the mutual information metric with a linear e...
Aloys du Bois d'Aische, Benoît Macq, Florian...
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 3 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
VLDB
2002
ACM
124views Database» more  VLDB 2002»
16 years 3 months ago
Efficient retrieval of similar shapes
Abstract. We propose an indexing technique for the fast retrieval of objects in 2D images based on similarity between their boundary shapes. Our technique is robust in the presence...
Davood Rafiei, Alberto O. Mendelzon
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 3 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
SIGMOD
2003
ACM
172views Database» more  SIGMOD 2003»
16 years 3 months ago
Dynamic Sample Selection for Approximate Query Processing
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
Brian Babcock, Surajit Chaudhuri, Gautam Das