Sciweavers

1722 search results - page 147 / 345
» On the sample mean of graphs
Sort
View
PODC
2009
ACM
16 years 7 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
CVPR
2001
IEEE
16 years 8 months ago
Optimal Texture Map Reconstruction from Multiple Views
The recovery of 3D models from multiple reference images involves not only the extraction of 3D shape, but also of texture. Assuming that all surfaces are Lambertian, the resultin...
Lifeng Wang, Sing Bing Kang, Richard Szeliski, Heu...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
16 years 1 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
FGR
2008
IEEE
299views Biometrics» more  FGR 2008»
16 years 27 days ago
Face recognition with occlusions in the training and testing sets
Partial occlusions in face images pose a great problem for most face recognition algorithms. Several solutions to this problem have been proposed over the years – ranging from d...
Hongjun Jia, Aleix M. Martínez
CDB
2004
Springer
158views Database» more  CDB 2004»
15 years 10 months ago
Constraint Databases, Data Structures and Efficient Query Evaluation
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
Joos Heintz, Bart Kuijpers