Sciweavers

5329 search results - page 100 / 1066
» The Weighted Majority Algorithm
Sort
View
SPAA
2010
ACM
14 years 2 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
PPOPP
2009
ACM
14 years 10 months ago
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Tong Li, Dan P. Baumberger, Scott Hahn
SPAA
1999
ACM
14 years 2 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
BMCBI
2010
153views more  BMCBI 2010»
13 years 10 months ago
Metamotifs - a generative model for building families of nucleotide position weight matrices
Background: Development of high-throughput methods for measuring DNA interactions of transcription factors together with computational advances in short motif inference algorithms...
Matias Piipari, Thomas A. Down, Tim J. P. Hubbard
ISCAS
2006
IEEE
81views Hardware» more  ISCAS 2006»
14 years 4 months ago
Equivalent output-filtering using fast QRD-RLS algorithm for burst-type training applications
— Fast QR decomposition RLS (FQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The FQRD-RLS algorithms do not provide acce...
Mobien Shoaib, Stefan Werner, J. A. Apoliná...