Sciweavers

5329 search results - page 444 / 1066
» The Weighted Majority Algorithm
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
15 years 6 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
FOCS
2009
IEEE
16 years 1 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
BMCBI
2007
105views more  BMCBI 2007»
15 years 6 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
TPDS
2008
164views more  TPDS 2008»
15 years 6 months ago
Hierarchical Scheduling for Symmetric Multiprocessors
Hierarchical scheduling has been proposed as a scheduling technique to achieve aggregate resource partitioning among related groups of threads and applications in uniprocessor and...
Abhishek Chandra, Prashant J. Shenoy
ICIP
2007
IEEE
16 years 8 months ago
An Adaptive Multiresolution Approach to Fingerprint Recognition
We propose an adaptive multiresolution (MR) approach to the classification of fingerprint images. The system adds MR decomposition in front of a generic classifier consisting of f...
Aliaksei Sandryhaila, Amina Chebira, Charles Jacks...