1059 search results - page 68 / 212 » Improved Algorithms via Approximations of Probability Distri... |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
113
click to vote
JMLR
2012
13 years 6 days ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
QEST
2006
IEEE
15 years 3 months ago
2006
IEEE
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
131
click to vote
ICIP
2001
IEEE
15 years 11 months ago
2001
IEEE
The HMM (Hidden Markov Model) is a probabilistic model of the joint probability of a collection of random variables with both observations and states. The GMM (Gaussian Mixture Mo...
JMLR
2010
14 years 4 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...