726 search results - page 86 / 146 » Recent advances in computational models of natural argument |
160
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
172
click to vote
IWCMC
2006
ACM
16 years 3 days ago
2006
ACM
Epidemic routing has been proposed as a robust transmission scheme for sparse mobile ad hoc networks. Under the assumption of no contention, epidemic routing has the minimum end-t...
142
click to vote
MFCS
2007
Springer
16 years 9 days ago
2007
Springer
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
186
click to vote
IJFCS
2006
15 years 6 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
160
click to vote
ACL
2003
15 years 7 months ago
2003
Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in...