3875 search results - page 504 / 775 » Approximation algorithms for the 0-extension problem |
156
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
174
click to vote
MLDM
2008
Springer
15 years 6 months ago
2008
Springer
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
188
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
165
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
174
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...