7930 search results - page 401 / 1586 » Greedy in Approximation Algorithms |
180
click to vote
CCCG
1998
15 years 8 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
182
click to vote
VMV
2003
15 years 8 months ago
2003
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
189
click to vote
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...
175
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...
199
click to vote
NIPS
2008
15 years 8 months ago
2008
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...