3875 search results - page 643 / 775 » Approximation algorithms for the 0-extension problem |
115
click to vote
CONSTRAINTS
2007
15 years 4 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...
147
click to vote
IJWIN
2006
15 years 4 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
142
click to vote
ITA
2007
15 years 4 months ago
2007
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
131
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
139
click to vote
MM
2009
ACM
15 years 11 months ago
2009
ACM
We consider the problem of broadcasting multiple variable-bit-rate (VBR) video streams from a base station to many mobile devices over a wireless network, so that: (i) perceived q...