2957 search results - page 325 / 592 » The Complexity of Polynomial-Time Approximation |
168
click to vote
NIPS
1994
15 years 8 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 ...
184
click to vote
UAI
1996
15 years 8 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 ...
176
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...
150
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we present several descent methods that can be applied to nonnegative matrix factorization and we analyze a recently developped fast block coordinate method. We als...
182
click to vote
COMPUTING
2006
15 years 6 months ago
2006
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...