7006 search results - page 267 / 1402 » Approximation Algorithms |
123
click to vote
RECOMB
2002
Springer
16 years 4 months ago
2002
Springer
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
127
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
143
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
127
Voted
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
133
click to vote
CG
2002
Springer
15 years 3 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...