5608 search results - page 214 / 1122 » On the Theory of Matchgate Computations |
172
click to vote
ACL
2003
15 years 8 months ago
2003
An investment of effort over the last two years has begun to produce a wealth of data concerning computational psycholinguistic models of syntax acquisition. The data is generated...
189
click to vote
IJCAI
2001
15 years 8 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
184
click to vote
UAI
2001
15 years 8 months ago
2001
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
158
click to vote
NIPS
1996
15 years 8 months ago
1996
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...
167
click to vote
AAAI
2008
15 years 7 months ago
2008
Arrow’s Impossibility Theorem is one of the landmark results in social choice theory. Over the years since the theorem was proved in 1950, quite a few alternative proofs have be...