Sciweavers

177 search results - page 11 / 36
» Semidefinite Programming Relaxations for the Quadratic Assig...
Sort
View
AUTOMATICA
2004
113views more  AUTOMATICA 2004»
13 years 9 months ago
Ellipsoidal bounds for uncertain linear equations and dynamical systems
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
Giuseppe Carlo Calafiore, Laurent El Ghaoui
JMLR
2006
124views more  JMLR 2006»
13 years 9 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
CVPR
2010
IEEE
13 years 11 months ago
Co-clustering of Image Segments Using Convex Optimization Applied to EM Neuronal Reconstruction
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structu...
Shiv Vitaladevuni, Ronen Basri
TSP
2008
109views more  TSP 2008»
13 years 9 months ago
Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints
This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of linearly coded puls...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
GLOBECOM
2009
IEEE
13 years 7 months ago
Received Signal Strength-Based Wireless Localization via Semidefinite Programming
The received signal strength (RSS)-based approach to wireless localization offers the advantage of low cost and easy implementability. To circumvent the nonconvexity of the convent...
Wentao Robin Ouyang, Albert Kai-Sun Wong, Chin-Tau...