Sciweavers

478 search results - page 24 / 96
» Convexity minimizes pseudo-triangulations
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Distributed subgradient projection algorithm for convex optimization
—We consider constrained minimization of a sum of convex functions over a convex and compact set, when each component function is known only to a specific agent in a timevarying...
Sundhar Srinivasan Ram, Angelia Nedic, Venugopal V...
ECCV
2008
Springer
14 years 9 months ago
A Convex Formulation of Continuous Multi-label Problems
We propose a spatially continuous formulation of Ishikawa's discrete multi-label problem. We show that the resulting non-convex variational problem can be reformulated as a co...
Thomas Pock, Thomas Schoenemann, Gottfried Graber,...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 8 months ago
Efficient Minimization of Decomposable Submodular Functions
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
Peter Stobbe, Andreas Krause
ISPD
1999
ACM
127views Hardware» more  ISPD 1999»
14 years 6 days ago
Buffer insertion for clock delay and skew minimization
 Buffer insertion is an effective approach to achieve both minimal clock signal delay and skew in high speed VLSI circuit design. In this paper, we develop an optimal buffer ins...
X. Zeng, D. Zhou, Wei Li
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 8 months ago
Interference Alignment as a Rank Constrained Rank Minimization
Abstract--We show that the maximization of the sum degreesof-freedom for the static flat-fading multiple-input multipleoutput (MIMO) interference channel is equivalent to a rank co...
Dimitris S. Papailiopoulos, Alexandros G. Dimakis