Sciweavers

104 search results - page 9 / 21
» Limit distribution of degrees in random family trees
Sort
View
CLUSTER
2009
IEEE
14 years 2 months ago
Oblivious routing schemes in extended generalized Fat Tree networks
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
Germán Rodríguez, Cyriel Minkenberg,...
BMCBI
2006
107views more  BMCBI 2006»
13 years 7 months ago
Simplifying gene trees for easier comprehension
Background: In the genomic age, gene trees may contain large amounts of data making them hard to read and understand. Therefore, an automated simplification is important. Results:...
Paul-Ludwig Lott, Marvin Mundry, Christoph Sassenb...
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 5 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
RSA
2010
89views more  RSA 2010»
13 years 5 months ago
A system of grabbing particles related to Galton-Watson trees
We consider a system of particles with arms that are activated randomly to grab other particles as a toy model for polymerization. We assume that the following two rules are fulï¬...
Jean Bertoin, Vladas Sidoravicius, Maria Eulalia V...
RSA
2008
84views more  RSA 2008»
13 years 6 months ago
Random partitions with restricted part sizes
: ForasubsetS ofpositiveintegerslet (n, S)bethesetofpartitionsofnintosummands that are elements of S. For every (n, S), let Mn() be the number of parts, with multiplicity, that ...
William M. Y. Goh, Pawel Hitczenko