Sciweavers

3694 search results - page 482 / 739
» Stochastic complexity in learning
Sort
View
ENTCS
2006
103views more  ENTCS 2006»
15 years 6 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 6 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 6 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 6 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
TCOS
2008
15 years 6 months ago
On Contemporary Denotational Mathematics for Computational Intelligence
Denotational mathematics is a category of expressive mathematical structures that deals with high-level mathematical entities beyond numbers and sets, such as abstract objects, com...
Yingxu Wang