1389 search results - page 138 / 278 » Improved Approximation Algorithms for Label Cover Problems |
112
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
102
click to vote
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...
142
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
135
click to vote
IVC
2002
15 years 3 months ago
2002
In this paper we address the problem of reliable real-time 3D-tracking of multiple objects which are observed in multiple wide-baseline camera views. Establishing the spatio-tempo...
103
Voted
IJCAI
1989
15 years 4 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...