Sciweavers

4843 search results - page 615 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
JMLR
2010
156views more  JMLR 2010»
14 years 11 months ago
Collaborative Filtering on a Budget
Matrix factorization is a successful technique for building collaborative filtering systems. While it works well on a large range of problems, it is also known for requiring signi...
Alexandros Karatzoglou, Alexander J. Smola, Markus...
MMAS
2010
Springer
14 years 11 months ago
Balanced Truncation of Linear Second-Order Systems: A Hamiltonian Approach
We present a formal procedure for structure-preserving model reduction of linear second-order and Hamiltonian control problems that appear in a variety of physical contexts, e.g., ...
Carsten Hartmann, Valentina-Mira Vulcanov, Christo...
SCHEDULING
2010
104views more  SCHEDULING 2010»
14 years 11 months ago
A fluid approach to large volume job shop scheduling
We consider large volume job shop scheduling problems, in which there is a fixed number of machines, a bounded number of activities per job, and a large number of jobs. In large v...
Yoni Nazarathy, Gideon Weiss
JMLR
2012
13 years 7 months ago
A General Framework for Structured Sparsity via Proximal Optimization
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
16 years 5 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...