Sciweavers

3591 search results - page 414 / 719
» Typing linear constraints
Sort
View
147
Voted
CORR
2010
Springer
70views Education» more  CORR 2010»
15 years 6 months ago
Structured sparsity-inducing norms through submodular functions
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
Francis Bach
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 6 months ago
Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels
Abstract--In this paper, the sum capacity of the Gaussian Multiple Input Multiple Output (MIMO) Cognitive Radio Channel (MCC) is expressed as a convex problem with finite number of...
Rajiv Soundararajan, Sriram Vishwanath
EOR
2010
113views more  EOR 2010»
15 years 6 months ago
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
Marie-Christine Plateau, Yasmin A. Rios-Solis
168
Voted
4OR
2006
100views more  4OR 2006»
15 years 6 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...
CAD
2007
Springer
15 years 6 months ago
Non-iterative approach for global mesh optimization
This paper presents a global optimization operator for arbitrary meshes. The global optimization operator is composed of two main terms, one part is the global Laplacian operator ...
Ligang Liu, Chiew-Lan Tai, Zhongping Ji, Guojin Wa...