Sciweavers

616 search results - page 61 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
WCW
2004
Springer
14 years 1 months ago
FatNemo: Building a Resilient Multi-source Multicast Fat-Tree
This paper proposes the idea of emulating fat-trees in overlays for multi-source multicast applications. Fat-trees are like real trees in that their branches become thicker the clo...
Stefan Birrer, Dong Lu, Fabián E. Bustamant...
ICPR
2002
IEEE
14 years 8 months ago
Building the Topological Tree by Recursive FCM Color Clustering
In this paper we define a Topological Tree (TT) as a knowledge representation method that aims to describe important visual and spatial features of image regions, namely the color...
Rita Cucchiara, Costantino Grana, Andrea Prati, St...
NIPS
2007
13 years 9 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
ADHOCNOW
2009
Springer
13 years 5 months ago
A Decentralized Approach to Minimum-Energy Broadcasting in Static Ad Hoc Networks
Broadcasting is a commonly used feature in wireless networking, e.g. for file distribution, re-tasking, event notification, or miscellaneous maintenance. Due to the limited resourc...
Christopher Miller, Christian Poellabauer
EH
2005
IEEE
134views Hardware» more  EH 2005»
14 years 1 months ago
Complexity Metrics for Self-monitoring Impact Sensing Networks
In this paper we describe novel metrics measuring complexity in self-organising networks. The metrics are investigated within the context of decentralised inspections, developed a...
Mikhail Prokopenko, Peter Wang, Don Price