87 search results - page 6 / 18 » Nearest Singular Polynomials |
APPROX
2009
Springer
14 years 2 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...
SIAMSC
2010
13 years 5 months ago
2010
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient ...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We construct a family of iterative discretization algorithms for computing sequences of finitely-supported correlated equilibria of n-player games with polynomial utility func...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
JSCIC
2008
13 years 7 months ago
2008
The spline element method with constraints is a discretization method where the unknowns are expanded as polynomials on each element and Lagrange multipliers are used to enforce th...