Sciweavers

2713 search results - page 137 / 543
» Parameterized Tree Systems
Sort
View
133
Voted
NIPS
2004
15 years 5 months ago
Using Random Forests in the Structured Language Model
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...
Peng Xu, Frederick Jelinek
111
Voted
IANDC
2007
126views more  IANDC 2007»
15 years 3 months ago
Alternating two-way AC-tree automata
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
Kumar Neeraj Verma, Jean Goubault-Larrecq
137
Voted
CORR
2011
Springer
178views Education» more  CORR 2011»
14 years 10 months ago
Anytime Reliable Codes for Stabilizing Plants over Erasure Channels
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
Ravi Teja Sukhavasi, Babak Hassibi
104
Voted
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
15 years 9 months ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri
130
Voted
AUSAI
2003
Springer
15 years 8 months ago
Combining Multiple Host-Based Detectors Using Decision Tree
Abstract. As the information technology grows interests in the intrusion detection system (IDS), which detects unauthorized usage, misuse by a local user and modification of impor...
Sang-Jun Han, Sung-Bae Cho