777 search results - page 19 / 156 » The Refined Process Structure Tree |
QEST
2008
IEEE
15 years 6 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
175
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
107
Voted
ICIP
2003
IEEE
16 years 1 months ago
2003
IEEE
Structural information about a document is essential for structured query processing, indexing, and retrieval. A document page can be partitioned into a hierarchy of homogeneous r...
CSB
2004
IEEE
15 years 3 months ago
2004
IEEE
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...