3378 search results - page 64 / 676 » Learning in Friedberg Numberings |
97
Voted
FLAIRS
2006
15 years 1 months ago
2006
A major difficulty in building Bayesian network models is the size of conditional probability tables, which grow exponentially in the number of parents. One way of dealing with th...
PAM
2005
Springer
15 years 6 months ago
2005
Springer
A number of key areas in IP network engineering, management and surveillance greatly benefit from the ability to dynamically identify traffic flows according to the applications re...
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
We investigate under what conditions clustering by learning a mixture of spherical Gaussians is (a) computationally tractable; and (b) statistically possible. We show that using p...
96
Voted
ICALT
2009
IEEE
15 years 7 months ago
2009
IEEE
A considerable number of serious games have been developed over the last ten years, with varying degrees of success. Due to a lack of clear standards and guidelines for game devel...
85
Voted
AAAI
2007
15 years 2 months ago
2007
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...