2520 search results - page 218 / 504 » The complexity of approximating entropy |
157
click to vote
CORR
2010
Springer
15 years 25 days ago
2010
Springer
We investigate enumerability properties for classes of random reals which permit recursive approximations from below, or left-r.e. reals. In addition to pinpointing the complexity...
155
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can ...
183
click to vote
PAMI
2008
15 years 5 months ago
2008
Variational Bayesian Expectation-Maximization (VBEM), an approximate inference method for probabilistic models based on factorizing over latent variables and model parameters, has ...
177
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
195
click to vote
CORR
2011
Springer
15 years 29 days ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...