777 search results - page 93 / 156 » The Refined Process Structure Tree |
171
click to vote
LATA
2010
Springer
16 years 15 days ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
138
click to vote
WEBDB
2005
Springer
15 years 11 months ago
2005
Springer
We present a system for efficient indexed querying of XML documents, enhanced with sibling operations. R-tree index proposed in [5] has a very high cost for the following-sibling...
140
click to vote
CLUSTER
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present a structure for monitoring a large set of computational clusters. We illustrate methods for scaling a monitor network comprised of many clusters while ke...
154
click to vote
ACL
2008
15 years 7 months ago
2008
Phrase-based decoding produces state-of-theart translations with no regard for syntax. We add syntax to this process with a cohesion constraint based on a dependency tree for the ...
167
click to vote
AAAI
1990
15 years 7 months ago
1990
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...