7150 search results - page 287 / 1430 » An Approximation Algorithm for Approximation Rank |
187
Voted
ISMB
1998
15 years 8 months ago
1998
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
171
click to vote
EMNLP
2010
15 years 4 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
143
click to vote
ICANNGA
2007
Springer
16 years 25 days ago
2007
Springer
Rates of approximation by networks with Gaussian RBFs with varying widths are investigated. For certain smooth functions, upper bounds are derived in terms of a Sobolev-equivalent ...
182
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
178
click to vote
CG
2002
Springer
15 years 6 months ago
2002
Springer
We present an algorithm for computing a robust adaptive polygonal approximation of an implicit curve in the plane. The approximation is adapted to the geometry of the curve because...