2553 search results - page 389 / 511 » Modeling Trees with Hypertextures |
126
Voted
ICML
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
120
Voted
CONCUR
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
159
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
128
Voted
KDD
1999
ACM
15 years 8 months ago
1999
ACM
Tree Augmented Naive Bayes (TAN) has shown to be competitive with state-of-the-art machine learning algorithms [3]. However, the TAN induction algorithm that appears in [3] can be...
161
Voted
GI
1997
Springer
15 years 7 months ago
1997
Springer
This paper gives an overview of an architecture and search organization for large vocabulary, continuous speech recognition (LVCSR at RWTH). In the rst part of the paper, we descri...