Sciweavers

648 search results - page 12 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
CP
2006
Springer
13 years 11 months ago
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Matthew J. Streeter, Stephen F. Smith
ICML
2010
IEEE
13 years 8 months ago
Simple and Efficient Multiple Kernel Learning by Group Lasso
We consider the problem of how to improve the efficiency of Multiple Kernel Learning (MKL). In literature, MKL is often solved by an alternating approach: (1) the minimization of ...
Zenglin Xu, Rong Jin, Haiqin Yang, Irwin King, Mic...
IWPEC
2004
Springer
14 years 1 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
ICPR
2006
IEEE
14 years 8 months ago
Feature selection based on the training set manipulation
A novel filter feature selection technique is introduced. The method exploits the information conveyed by the evolution of the training samples weights similarly to the Adaboost a...
Pavel Krízek, Josef Kittler, Václav ...
MMB
2004
Springer
102views Communications» more  MMB 2004»
14 years 1 months ago
Improving the Timeliness of Rate Measurements
Rate measurements are required for many purposes, e.g. for system analysis and modelling or for live systems that react to measurements. For off-line measurement all data is avail...
Rüdiger Martin, Michael Menth