459 search results - page 92 / 92 » Computational Complexity of Probabilistic Disambiguation |
IANDC
2007
13 years 5 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
BMCBI
2002
13 years 5 months ago
2002
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
WWW
2011
ACM
13 years 14 days ago
2011
ACM
The psycholinguistic theory of communication accommodation accounts for the general observation that participants in conversations tend to converge to one another’s communicativ...
SIGMOD
2011
ACM
12 years 8 months ago
2011
ACM
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...