Sciweavers

18306 search results - page 325 / 3662
» Algorithmics in Exponential Time
Sort
View
FSTTCS
2007
Springer
16 years 28 days ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
16 years 27 days ago
On the Robustness of Graham's Algorithm for Online Scheduling
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
Michael Gatto, Peter Widmayer
TALG
2008
127views more  TALG 2008»
15 years 6 months ago
Fully dynamic algorithms for chordal graphs and split graphs
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
Louis Ibarra
APCCAS
2006
IEEE
323views Hardware» more  APCCAS 2006»
16 years 26 days ago
Real-Time Implementation of a Particle Filter with Integrated Voice Activity Detector for Acoustic Speaker Tracking
— In noisy and reverberant environments, the problem of acoustic source localisation and tracking (ASLT) using an array of microphones presents a number of challenging difficult...
Anders M. Johansson, Eric A. Lehmann, Sven Nordhol...
BMCBI
2010
157views more  BMCBI 2010»
15 years 6 months ago
SeqTrim: a high-throughput pipeline for pre-processing any type of sequence read
Background: High-throughput automated sequencing has enabled an exponential growth rate of sequencing data. This requires increasing sequence quality and reliability in order to a...
Juan Falgueras, Antonio J. Lara, Noé Fern&a...