906 search results - page 108 / 182 » Matching Subsequences in Trees |
MPC
2000
Springer
14 years 18 days ago
2000
Springer
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
VLDB
2007
ACM
14 years 9 months ago
2007
ACM
The deep Web presents a pressing need for integrating large numbers of dynamically evolving data sources. To be more automatic yet accurate in building an integration system, we o...
PDCN
2007
13 years 10 months ago
2007
Packet classification continues to be an important challenge in network processing. It requires matching each packet against a database of rules and forwarding the packet accordi...
BIBM
2008
IEEE
14 years 3 months ago
2008
IEEE
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...