Sciweavers

616 search results - page 44 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
MOBIHOC
2012
ACM
11 years 10 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
WOWMOM
2006
ACM
110views Multimedia» more  WOWMOM 2006»
14 years 1 months ago
Minimum Cost Wireless Broadband Overlay Network Planning
Wireless broadband networks, especially WiMAX networks, have emerged in the industry recently and many challenging research issues arise. In this paper, we proposed a heuristic cl...
Peng Lin, Hung Q. Ngo, Chunming Qiao, Xin Wang, Ti...
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
14 years 2 months ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...
ICPP
2005
IEEE
14 years 1 months ago
Design and Implementation of Overlay Multicast Protocol for Multimedia Streaming
In this paper, we propose a new protocol called Shared Tree Streaming (or STS in short) protocol that is designed for interactive multimedia streaming applications. STS is a decen...
Thilmee M. Baduge, Akihito Hiromori, Hirozumi Yama...
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
14 years 8 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...