Sciweavers

2520 search results - page 224 / 504
» The complexity of approximating entropy
Sort
View
SIAMNUM
2011
139views more  SIAMNUM 2011»
15 years 1 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson
JMLR
2010
118views more  JMLR 2010»
15 years 1 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
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...
Julian John McAuley, Tibério S. Caetano
TOG
2010
97views more  TOG 2010»
15 years 1 months ago
A practical simulation of dispersed bubble flow
In this paper, we propose a simple and efficient framework for simulating dispersed bubble flow. Instead of modeling the complex hydrodynamics of numerous small bubbles explicitly...
Doyub Kim, Oh-Young Song, Hyeong-Seok Ko
VTC
2006
IEEE
138views Communications» more  VTC 2006»
16 years 17 days ago
Transmit Precoding for the Multiple Antenna Broadcast Channel
— In this paper we compare the following two methods of transmit precoding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also term...
Manish Airy, Sandeep Bhadra, Robert W. Heath Jr., ...
NIPS
2007
15 years 8 months ago
The Tradeoffs of Large Scale Learning
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
Léon Bottou, Olivier Bousquet