Sciweavers

9572 search results - page 325 / 1915
» Cover Algorithms and Their Combination
Sort
View
PODC
2004
ACM
16 years 3 days ago
Group membership: a novel approach and the first single-round algorithm
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
Roger I. Khazan
SIMPRA
2011
15 years 1 months ago
Virtual segment: Store-carry-forward relay-based support for wide-area non-real-time data exchange
—In the Internet of the future, a flexible, dynamic combination of wireless and wired access networks is expected to be a key driver for enlarging the broadband communication se...
Shinya Yamamura, Akira Nagata, Masato Tsuru, Hitom...
SSPR
2004
Springer
16 years 1 days ago
Optimizing Classification Ensembles via a Genetic Algorithm for a Web-Based Educational System
Classification fusion combines multiple classifications of data into a single classification solution of greater accuracy. Feature extraction aims to reduce the computational cost ...
Behrouz Minaei-Bidgoli, Gerd Kortemeyer, William F...
PODC
2005
ACM
16 years 7 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
MST
2010
187views more  MST 2010»
15 years 1 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda