3656 search results - page 307 / 732 » Compact Location Problems |
188
click to vote
ACL
2001
15 years 8 months ago
2001
In this paper, a new language model, the Multi-Class Composite N-gram, is proposed to avoid a data sparseness problem for spoken language in that it is difficult to collect traini...
188
click to vote
ICMLA
2004
15 years 8 months ago
2004
Complexity, or in other words compactness, of models generated by rule learners is one of often neglected issues, although it has a profound effect on the success of any project t...
184
click to vote
AAAI
1998
15 years 8 months ago
1998
This paperconsidersthe problem of representingcomplex systems that evolve stochastically over time. Dynamic Bayesian networks provide a compact representation for stochastic proce...
180
click to vote
ACL
1996
15 years 8 months ago
1996
Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We p...
166
click to vote
IJCAI
1989
15 years 7 months ago
1989
The difficulty of maintaining very large software systems is becoming more widely acknowledged. One of the primary problems is the need to access information about a complex and e...