Sciweavers

10901 search results - page 261 / 2181
» Approximations in Distributed Optimization
Sort
View
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
16 years 4 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
FOCI
2007
IEEE
16 years 29 days ago
Almost All Learning Machines are Singular
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
Sumio Watanabe
IPSN
2003
Springer
15 years 11 months ago
Hypothesis Testing over Factorizations for Data Association
Abstract. The issue of data association arises frequently in sensor networks; whenever multiple sensors and sources are present, it may be necessary to determine which observations...
Alexander T. Ihler, John W. Fisher III, Alan S. Wi...
BDA
2007
15 years 8 months ago
PeerSum: Summary Management in P2P Systems
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffi...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
IPPS
2010
IEEE
15 years 4 months ago
Robust control-theoretic thermal balancing for server clusters
Thermal management is critical for clusters because of the increasing power consumption of modern processors, compact server architectures and growing server density in data center...
Yong Fu, Chenyang Lu, Hongan Wang