783 search results - page 43 / 157 » Improved approximation algorithms for the freeze-tag problem |
162
click to vote
APPROX
1998
Springer
15 years 10 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
157
click to vote
TCC
2007
Springer
15 years 12 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
176
click to vote
CVPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper presents a novel algorithm that improves the localization of disparity discontinuities of disparity maps obtained by multi-baseline stereo. Rather than associating a di...
158
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
149
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...