161 search results - page 13 / 33 » Methods for convex and general quadratic programming |
269
click to vote
TKDE
2012
13 years 6 months ago
2012
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
126
click to vote
TSP
2010
14 years 11 months ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
167
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...
161
click to vote
DAC
2006
ACM
15 years 10 months ago
2006
ACM
This paper investigates methods for clock skew minimization using buffer and wire sizing. First, a technique that significantly improves solution quality and stability of sequent...
170
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach was developed in order to generate a dense disparity field. In ...