23 search results - page 3 / 5 » Computational Aspects of Covering in Dominance Graphs |
FOCS
2008
IEEE
14 years 7 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
FOCS
2009
IEEE
14 years 16 days ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
BMCV
2000
Springer
13 years 10 months ago
2000
Springer
We here describe a view-based system for the pose-independent representation of objects without making reference to 3-D models. Input to the system is a collection of pictures cov...
DAGM
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
COLT
1993
Springer
13 years 10 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...