Sciweavers

473 search results - page 1 / 95
» The multiplicative power of consensus numbers
Sort
View
PODC
2010
ACM
13 years 8 months ago
The multiplicative power of consensus numbers
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
Damien Imbs, Michel Raynal
BIOINFORMATICS
2010
170views more  BIOINFORMATICS 2010»
13 years 5 months ago
Joint estimation of DNA copy number from multiple platforms
DNA copy number variants (CNV) are gains and losses of segments of chromosomes, and comprise an important class of genetic variation. Recently, various microarray hybridization ba...
Nancy R. Zhang, Yasin Senbabaoglu, Jun Z. Li
CDC
2008
IEEE
192views Control Systems» more  CDC 2008»
13 years 6 months ago
Distributed coordination algorithms for multiple fractional-order systems
Abstract-- This paper studies distributed coordination algorithms for multiple fractional-order systems over a directed communication graph. A general fractional-order consensus mo...
Yongcan Cao, Yan Li, Wei Ren, Yangquan Chen
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
13 years 10 months ago
Combining Multiple Weak Clusterings
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
Alexander P. Topchy, Anil K. Jain, William F. Punc...
DC
2008
13 years 4 months ago
Failure detectors as type boosters
The power of an object type T can be measured as the maximum number n of processes that can solve consensus using only objects of T and registers. This number, denoted cons(T), is ...
Rachid Guerraoui, Petr Kouznetsov