Sciweavers

9719 search results - page 497 / 1944
» Inference for Multiplicative Models
Sort
View
NIPS
2008
15 years 6 months ago
The Infinite Factorial Hidden Markov Model
We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP...
Jurgen Van Gael, Yee Whye Teh, Zoubin Ghahramani
123
Voted
AAAI
1996
15 years 6 months ago
Learning Models of Intelligent Agents
Agents that operate in a multi-agent system need an efficient strategy to handle their encounters with other agents involved. Searching for an optimal interactive strategy is a ha...
David Carmel, Shaul Markovitch
JUCS
2002
101views more  JUCS 2002»
15 years 4 months ago
Modelling Agents as Observable Sources
Abstract: Observation is a fundamental interaction pattern in today's computerbased systems. Adopting observation as the main modelling criterion, computer-based systems can b...
Mirko Viroli, Andrea Omicini
TIT
1998
123views more  TIT 1998»
15 years 4 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu
PVLDB
2010
119views more  PVLDB 2010»
15 years 3 months ago
An Architecture for Parallel Topic Models
This paper describes a high performance sampling architecture for inference of latent topic models on a cluster of workstations. Our system is faster than previous work by over an...
Alexander J. Smola, Shravan Narayanamurthy