2214 search results - page 74 / 443 » complexity 2004 |
99
Voted
CORR
2004
Springer
15 years 14 days ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
99
Voted
CORR
2004
Springer
15 years 14 days ago
2004
Springer
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
96
Voted
SIGMOD
2004
ACM
16 years 23 days ago
2004
ACM
We present BLAS , a Bi-LAbeling based System, for efficiently processing complex XPath queries over XML data. BLAS uses Plabeling to process queries involving consecutive child ax...
123
Voted
COCO
2004
Springer
15 years 6 months ago
2004
Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
119
Voted
IWPEC
2004
Springer
15 years 6 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...