12519 search results - page 415 / 2504 » Approximation Problems Categories |
166
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...
130
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
Let s be the ratio of the cost for purchasing skis over the cost for renting them. Then the famous result for the ski-rental problem shows that skiers should buy their skis after r...
215
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Modeling the behavior of imperfect agents from a small number of observations is a difficult, but important task. In the singleagent decision-theoretic setting, inverse optimal co...
221
click to vote
ESA
2011
Springer
14 years 6 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
167
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...