7150 search results - page 74 / 1430 » An Approximation Algorithm for Approximation Rank |
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...
78
Voted
CG
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
104
Voted
CORR
2010
Springer
15 years 20 days ago
2010
Springer
ABSTRACT. In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorit...
103
Voted
CCCG
2010
15 years 2 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
125
click to vote
ALGORITHMICA
1998
15 years 8 days ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...