5183 search results - page 131 / 1037 » The Complexity of Distributions |
173
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents a new algorithm called List-based Load Balancing (LLB) for compile-time task scheduling on distributed-memory machines. LLB is intended as a cluster-mapping an...
277
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and non-uniform nodal distributio...
177
click to vote
VOSS
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
147
click to vote
NIPS
2007
15 years 8 months ago
2007
We utilize the ensemble of trees framework, a tractable mixture over superexponential number of tree-structured distributions [1], to develop a new model for multivariate density ...
197
click to vote
WDAG
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...