1332 search results - page 36 / 267 » An Efficient Algorithm for the Approximate Median Selection ... |
ESANN
2007
13 years 10 months ago
2007
Abstract. The convex optimisation problem involved in fitting a kernel probit regression (KPR) model can be solved efficiently via an iteratively re-weighted least-squares (IRWLS)...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
TSP
2008
13 years 8 months ago
2008
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...