Sciweavers

423 search results - page 47 / 85
» Topology for Distributed Inference on Graphs
Sort
View
118
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
INFFUS
2010
143views more  INFFUS 2010»
14 years 10 months ago
A multi-agent systems approach to distributed bayesian information fusion
This paper introduces design principles for modular Bayesian fusion systems which can (i) cope with large quantities of heterogeneous information and (ii) can adapt to changing co...
Gregor Pavlin, Patrick de Oude, Marinus Maris, Jan...
3DIM
2007
IEEE
15 years 6 months ago
Generalized MPU Implicits Using Belief Propagation
In this paper, we present a new algorithm to reconstruct 3D surfaces from an unorganized point cloud based on generalizing the MPU implicit algorithm through introducing a powerfu...
Yi-Ling Chen, Shang-Hong Lai, Tung-Ying Lee
ICT
2004
Springer
120views Communications» more  ICT 2004»
15 years 5 months ago
Scalable End-to-End Multicast Tree Fault Isolation
We present a novel protocol, M3L, for multicast tree fault isolation based purely upon end-to-end information. Here, a fault is a link with a loss rate exceeding a specified thres...
Timur Friedman, Donald F. Towsley, James F. Kurose
IPPS
2002
IEEE
15 years 4 months ago
Toward Optimal Diffusion Matrices
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area has mainly been focusing on homogeneous schemes. Howeve...
Robert Elsässer, Burkhard Monien, Günter...