Sciweavers

9572 search results - page 346 / 1915
» Cover Algorithms and Their Combination
Sort
View
ICML
2003
IEEE
16 years 7 months ago
Online Choice of Active Learning Algorithms
This paper is concerned with the question of how to online combine an ensemble of active learners so as to expedite the learning progress during a pool-based active learning sessi...
Yoram Baram, Ran El-Yaniv, Kobi Luz
SAC
2006
ACM
16 years 20 days ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
ESTIMEDIA
2004
Springer
16 years 3 days ago
Trace-based evaluation of clock synchronization algorithms for wireless loudspeakers
We present an evaluation strategy for clock synchronization algorithms. It is based on a combination of measured traces, which provide for realistic performance estimation, and of...
Philipp Blum, Lothar Thiele
SLS
2009
Springer
274views Algorithms» more  SLS 2009»
15 years 11 months ago
A Memetic Algorithm for the Multidimensional Assignment Problem
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
Gregory Gutin, Daniel Karapetyan
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
15 years 10 months ago
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall