239 search results - page 48 / 48 » Proof Techniques for Cryptographic Processes |
COLING
1996
15 years 29 days ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
NIPS
1993
15 years 29 days ago
1993
Recent developments in the area of reinforcement learning have yielded a number of new algorithms for the prediction and control of Markovian environments. These algorithms,includ...
114
click to vote
CCR
2010
14 years 11 months ago
2010
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
103
click to vote
SIAMCO
2008
14 years 11 months ago
2008
The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence on the...