Sciweavers

3250 search results - page 400 / 650
» Parameterized Learning Complexity
Sort
View
NIPS
2003
15 years 5 months ago
Bias-Corrected Bootstrap and Model Uncertainty
The bootstrap has become a popular method for exploring model (structure) uncertainty. Our experiments with artificial and realworld data demonstrate that the graphs learned from...
Harald Steck, Tommi Jaakkola
ENTCS
2006
103views more  ENTCS 2006»
15 years 4 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
EXPERT
2006
66views more  EXPERT 2006»
15 years 4 months ago
Representation as a Fluent: An AI Challenge for the Next Half Century
We argue that artificial intelligence systems must be able to manipulate their own internal representations automatically in order to deal with an infinitely complex and ever chan...
Alan Bundy, Fiona McNeill
CGF
2007
127views more  CGF 2007»
15 years 4 months ago
Crowds by Example
We present an example-based crowd simulation technique. Most crowd simulation techniques assume that the behavior exhibited by each person in the crowd can be defined by a restri...
Alon Lerner, Yiorgos Chrysanthou, Dani Lischinski
CSDA
2007
134views more  CSDA 2007»
15 years 4 months ago
Variational approximations in Bayesian model selection for finite mixture distributions
Variational methods for model comparison have become popular in the neural computing/machine learning literature. In this paper we explore their application to the Bayesian analys...
Clare A. McGrory, D. M. Titterington