Sciweavers

478 search results - page 43 / 96
» Convexity minimizes pseudo-triangulations
Sort
View
GLOBECOM
2010
IEEE
13 years 5 months ago
Filter-and-Forward Distributed Beamforming for Two-Way Relay Networks with Frequency Selective Channels
Abstract-- A new approach to distributed cooperative beamforming in two-way half-duplex relay networks with frequency selective channels is proposed. In our scheme, two transceiver...
Haihua Chen, Alex B. Gershman, Shahram Shahbazpana...
CDC
2010
IEEE
182views Control Systems» more  CDC 2010»
13 years 3 months ago
An approximate dual subgradient algorithm for multi-agent non-convex optimization
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
Minghui Zhu, Sonia Martínez
JMLR
2010
187views more  JMLR 2010»
13 years 2 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
TSP
2010
13 years 2 months ago
Methods for sparse signal recovery using Kalman filtering with embedded pseudo-measurement norms and quasi-norms
We present two simple methods for recovering sparse signals from a series of noisy observations. The theory of compressed sensing (CS) requires solving a convex constrained minimiz...
Avishy Carmi, Pini Gurfil, Dimitri Kanevsky
EMMCVPR
2011
Springer
12 years 7 months ago
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
Jan Lellmann, Frank Lenzen, Christoph Schnörr