391 search results - page 40 / 79 » Constructive Equivalence Relations on Computable Probability... |
ACL
1998
15 years 26 days ago
1998
The probabilistic relation between verbs and their arguments plays an important role in modern statistical parsers and supertaggers, and in psychological theories of language proc...
SAT
2009
Springer
15 years 6 months ago
2009
Springer
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
116
click to vote
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
LICS
2003
IEEE
15 years 4 months ago
2003
IEEE
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
ICPR
2008
IEEE
16 years 21 days ago
2008
IEEE
Automatic construction of Shape and Appearance Models from examples via establishing correspondences across the training set has been successful in the last decades. One successfu...