1272 search results - page 51 / 255 » Approximate Parameterized Matching |
101
click to vote
FQAS
2009
Springer
15 years 5 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
JCB
2007
14 years 11 months ago
2007
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
92
Voted
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
103
click to vote
INFORMS
2010
14 years 9 months ago
2010
We present an approximate dynamic programming approach for making ambulance redeployment decisions in an emergency medical service system. The primary decision is where we should ...