Sciweavers

133 search results - page 15 / 27
» A finiteness theorem for Markov bases of hierarchical models
Sort
View
IJCAI
2007
13 years 8 months ago
Opponent Modeling in Scrabble
Computers have already eclipsed the level of human play in competitive Scrabble, but there remains room for improvement. In particular, there is much to be gained by incorporating...
Mark Richards, Eyal Amir
ICMAS
2000
13 years 8 months ago
Reasoning About Others: Representing and Processing Infinite Belief Hierarchies
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
Sviatoslav Brainov, Tuomas Sandholm
NIPS
2001
13 years 8 months ago
Latent Dirichlet Allocation
We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian m...
David M. Blei, Andrew Y. Ng, Michael I. Jordan
IANDC
2011
84views more  IANDC 2011»
13 years 2 months ago
Teaching randomized learners with feedback
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
Frank J. Balbach, Thomas Zeugmann
PIMRC
2008
IEEE
14 years 1 months ago
The Wireless Engset Multi-Rate Loss Model for the Handoff traffic analysis in W-CDMA networks
—The call-level performance modelling and evaluation of 3G cellular networks is important for the proper network dimensioning and efficient use of the network resources, such as ...
Vassilios G. Vassilakis, Michael D. Logothetis