1814 search results - page 52 / 363 » Improved Results on Geometric Hitting Set Problems |
CODCRY
2011
Springer
13 years 18 days ago
2011
Springer
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
PRL
2007
13 years 8 months ago
2007
Several computer vision problems, like segmentation, tracking and shape modeling, are increasingly being solved using level set methodologies. But the critical issues of stability...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
ICQNM
2007
IEEE
14 years 3 months ago
2007
IEEE
— From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and ...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...