1389 search results - page 163 / 278 » Improved Approximation Algorithms for Label Cover Problems |
124
click to vote
NIPS
2007
15 years 4 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
137
click to vote
ICRA
2006
IEEE
15 years 9 months ago
2006
IEEE
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
101
click to vote
CONSTRAINTS
2007
15 years 3 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
152
click to vote
FOCM
2006
15 years 3 months ago
2006
This paper considers the regularized learning algorithm associated with the leastsquare loss and reproducing kernel Hilbert spaces. The target is the error analysis for the regres...
206
click to vote
DCOSS
2011
Springer
14 years 3 months ago
2011
Springer
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...