Sciweavers

4843 search results - page 924 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
15 years 10 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
CVPR
2007
IEEE
15 years 12 months ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...
CVPR
2008
IEEE
15 years 12 months ago
Physical simulation for probabilistic motion tracking
Human motion tracking is an important problem in computer vision. Most prior approaches have concentrated on efficient inference algorithms and prior motion models; however, few c...
Marek Vondrak, Leonid Sigal, Odest Chadwicke Jenki...
ICCV
2007
IEEE
15 years 12 months ago
3-D Reconstruction from Sparse Views using Monocular Vision
We consider the task of creating a 3-d model of a large novel environment, given only a small number of images of the scene. This is a difficult problem, because if the images are...
Ashutosh Saxena, Min Sun, Andrew Y. Ng
ECCV
2002
Springer
15 years 11 months ago
Tracking and Object Classification for Automated Surveillance
In this paper we discuss the issues that need to be resolved before fully automated outdoor surveillance systems can be developed, and present solutions to some of these problems. ...
Omar Javed, Mubarak Shah