23 search results - page 5 / 5 » A Polynomial-Time Algorithm for the Matching of Crossing Con... |
CPM
2009
Springer
13 years 11 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
ICDE
2005
IEEE
14 years 6 months ago
2005
IEEE
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...