1974 search results - page 106 / 395 » On Unbiased Linear Approximations |
APPROX
2009
Springer
15 years 7 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...
108
click to vote
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
117
Voted
ECCV
2004
Springer
16 years 2 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...
129
Voted
FOCS
2006
IEEE
15 years 6 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 ...
101
Voted
COMPGEOM
2009
ACM
15 years 7 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 ...