7930 search results - page 406 / 1586 » Greedy in Approximation Algorithms |
165
click to vote
RECOMB
2002
Springer
16 years 7 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...
180
click to vote
IJCAI
2003
15 years 8 months ago
2003
We present an approximate policy iteration algorithm that uses rollouts to estimate the value of each action under a given policy in a subset of states and a classifier to general...
140
Voted
ECCC
2010
15 years 6 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
145
click to vote
JDA
2006
15 years 6 months ago
2006
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...
147
Voted
MOC
2002
15 years 6 months ago
2002
The authors study the Hilbert Transform on the real line. They introduce some polynomial approximations and some algorithms for its numerical evaluation. Error estimates in uniform...