2698 search results - page 125 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
185
click to vote
ESA
2007
Springer
16 years 17 days ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
182
click to vote
PAMI
2006
15 years 6 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
158
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
146
click to vote
IJCGA
2002
15 years 6 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
159
click to vote
BMVC
2001
15 years 8 months ago
2001
This paper presents an iterative maximum likelihood framework for motion segmentation via the pairwise checking of pixel blocks. We commence from a characterisation of the motion ...