239 search results - page 31 / 48 » A Simple Algorithm for Computing the Lempel Ziv Factorizatio... |
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
CVPR
2000
IEEE
14 years 10 months ago
2000
IEEE
This paper addresses the problem of recovering 3D non-rigid shape models from image sequences. For example, given a video recording of a talking person, we would like to estimate ...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
FSTTCS
1995
Springer
13 years 12 months ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...