3044 search results - page 180 / 609 » Linear logical approximations |
147
Voted
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
116
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
153
Voted
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
Various problems in Computer Vision become difficult due to a strong influence of lighting on the images of an object. Recent work showed analytically that the set of all images of...
164
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
126
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...