Sciweavers

1118 search results - page 123 / 224
» Convex Optimization
Sort
View
NIPS
2004
13 years 10 months ago
Distributed Information Regularization on Graphs
We provide a principle for semi-supervised learning based on optimizing the rate of communicating labels for unlabeled points with side information. The side information is expres...
Adrian Corduneanu, Tommi Jaakkola
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 9 months ago
A Semidefinite Relaxation for Air Traffic Flow Scheduling
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...
Alexandre d'Aspremont, Laurent El Ghaoui
SIAMCOMP
2008
95views more  SIAMCOMP 2008»
13 years 9 months ago
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
Nir Halman
TSMC
2002
119views more  TSMC 2002»
13 years 9 months ago
Approximation of n-dimensional data using spherical and ellipsoidal primitives
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
Giuseppe Carlo Calafiore
TIT
2010
110views Education» more  TIT 2010»
13 years 4 months ago
Error rates of the maximum-likelihood detector for arbitrary constellations: convex/concave behavior and applications
Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity properties of error rates of the maximum likelihood detector operating in the AWGN ch...
Sergey Loyka, Victoria Kostina, François Ga...