422 search results - page 15 / 85 » On Non-Approximability for Quadratic Programs |
111
Voted
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...
126
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
118
Voted
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
154
Voted
TSP
2011
14 years 10 months ago
2011
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...
137
Voted
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
One of the main tasks in analog design is the sizing of the circuit parameters, such as transistor lengths and widths, in order to obtain optimal circuit performances, such as hig...