2190 search results - page 281 / 438 » Learning with the Set Covering Machine |
107
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
The conditional distribution of a discrete variable y, given another discrete variable x, is often specified by assigning one multinomial distribution to each state of x. The cost...
119
Voted
ICML
2003
IEEE
16 years 1 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
74
Voted
ICML
2002
IEEE
16 years 1 months ago
2002
IEEE
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
115
Voted
ICML
2000
IEEE
16 years 1 months ago
2000
IEEE
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech t...
99
Voted
ALT
2008
Springer
15 years 9 months ago
2008
Springer
In numerous application areas fast growing data sets develop with ever higher complexity and dynamics. A central challenge is to filter the substantial information and to communic...