Sciweavers

648 search results - page 35 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
STOC
2000
ACM
134views Algorithms» more  STOC 2000»
14 years 2 days ago
Computing the median with uncertainty
We consider a new model for computing with uncertainty. It is desired to compute a function fX1; : : : ; Xn where X1; : : : ; Xn are unknown, but guaranteed to lie in speci ed i...
Tomás Feder, Rajeev Motwani, Rina Panigrahy...
JMLR
2010
151views more  JMLR 2010»
13 years 2 months ago
The Feature Selection Path in Kernel Methods
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...
Fuxin Li, Cristian Sminchisescu
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 9 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
CVPR
2012
IEEE
11 years 10 months ago
Boosting algorithms for simultaneous feature extraction and selection
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...
Mohammad J. Saberian, Nuno Vasconcelos
WIOPT
2010
IEEE
13 years 6 months ago
Low complexity algorithms for relay selection and power control in interference-limited environments
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
Lazaros Gkatzikis, Iordanis Koutsopoulos