Sciweavers

4277 search results - page 397 / 856
» On Multiple Linear Approximations
Sort
View
SIAMIS
2011
14 years 6 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
TMC
2011
203views more  TMC 2011»
14 years 6 months ago
Throughput Optimization in Mobile Backbone Networks
—This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which hav...
Emily M. Craparo, Jonathan P. How, Eytan Modiano
JMLR
2010
129views more  JMLR 2010»
14 years 6 months ago
Expectation Truncation and the Benefits of Preselection In Training Generative Models
We show how a preselection of hidden variables can be used to efficiently train generative models with binary hidden variables. The approach is based on Expectation Maximization (...
Jörg Lücke, Julian Eggert
SIAMNUM
2010
150views more  SIAMNUM 2010»
14 years 6 months ago
Quasi-Optimal Convergence Rate of an Adaptive Discontinuous Galerkin Method
We analyze an adaptive discontinuous finite element method (ADFEM) for symmetric second order linear elliptic operators. The method is formulated on nonconforming meshes made of si...
Andrea Bonito, Ricardo H. Nochetto
TMC
2012
13 years 2 months ago
A Statistical Mechanics-Based Framework to Analyze Ad Hoc Networks with Random Access
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
Sunil Srinivasa, Martin Haenggi