Sciweavers

225 search results - page 34 / 45
» Approximating Parameterized Convex Optimization Problems
Sort
View
SIAMIS
2011
13 years 3 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...
ICML
2005
IEEE
14 years 9 months ago
Fast maximum margin matrix factorization for collaborative prediction
Maximum Margin Matrix Factorization (MMMF) was recently suggested (Srebro et al., 2005) as a convex, infinite dimensional alternative to low-rank approximations and standard facto...
Jason D. M. Rennie, Nathan Srebro
INFOCOM
2003
IEEE
14 years 1 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
CORR
2010
Springer
145views Education» more  CORR 2010»
13 years 8 months ago
Distributed Rate Allocation Policies for Multi-Homed Video Streaming over Heterogeneous Access Networks
We consider the problem of rate allocation among multiple simultaneous video streams sharing multiple heterogeneous access networks. We develop and evaluate an analytical framework...
Xiaoqing Zhu, Piyush Agrawal, Jatinder Pal Singh, ...
4OR
2010
137views more  4OR 2010»
13 years 8 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...