2520 search results - page 231 / 504 » The complexity of approximating entropy |
161
click to vote
NIPS
2008
15 years 8 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
175
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
165
click to vote
NIPS
1994
15 years 7 months ago
1994
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
183
click to vote
UAI
1996
15 years 7 months ago
1996
We extend the Bayesian Information Criterion (BIC), an asymptotic approximation for the marginal likelihood, to Bayesian networks with hidden variables. This approximation can be ...
173
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
As passive optical networks (PON) are increasingly deployed to provide high speed Internet access, it is important to understand their fundamental traffic capacity limits. The pape...