Sciweavers

161 search results - page 23 / 33
» Methods for convex and general quadratic programming
Sort
View
TSP
2008
124views more  TSP 2008»
15 years 4 months ago
Robust Beamforming via Worst-Case SINR Maximization
Minimum variance beamforming, which uses a weight vector that maximizes the signal-to-interference-plus-noise ratio (SINR), is often sensitive to estimation error and uncertainty i...
Seung-Jean Kim, Alessandro Magnani, Almir Mutapcic...
CORR
2011
Springer
155views Education» more  CORR 2011»
14 years 8 months ago
On the Generation of Positivstellensatz Witnesses in Degenerate Cases
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
David Monniaux, Pierre Corbineau
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 4 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu
NIPS
2000
15 years 5 months ago
Improved Output Coding for Classification Using Continuous Relaxation
Output coding is a general method for solving multiclass problems by reducing them to multiple binary classification problems. Previous research on output coding has employed, alm...
Koby Crammer, Yoram Singer
ICMCS
2007
IEEE
146views Multimedia» more  ICMCS 2007»
15 years 10 months ago
A Max Margin Framework on Image Annotation and Multimodal Image Retrieval
This paper presents a max margin framework on image annotation and multimodal image retrieval as a structured prediction model. Following the max margin approach the image retriev...
Zhen Guo, Zhongfei Zhang, Eric P. Xing, Christos F...