49 search results - page 6 / 10 » On Perfect Matching Coverings and Even Subgraph Coverings |
APPROX
2006
Springer
13 years 10 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
BMVC
2010
13 years 4 months ago
2010
Template matching is a well-proven approach in the area of articulated object tracking. Matching accuracy and computation time of template matching are essential and yet often con...
ICCV
1998
IEEE
14 years 8 months ago
1998
IEEE
`Invariant regions' are image patches that automatically deform with changing viewpoint as to keep on covering identical physical parts of a scene. Such regions are then desc...