5372 search results - page 349 / 1075 » complexity 2007 |
151
click to vote
ACSW
2004
15 years 8 months ago
2004
We present a detailed examination of the access constraints for a small real-world Health Information System with the aim of achieving minimal access rights for each of the involv...
170
click to vote
ACL
2006
15 years 8 months ago
2006
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
156
click to vote
ALENEX
2004
15 years 8 months ago
2004
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
168
click to vote
ACL
2006
15 years 8 months ago
2006
We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting...
174
click to vote
ACL
2006
15 years 8 months ago
2006
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...