Sciweavers

396 search results - page 56 / 80
» An Optimal Minimum Spanning Tree Algorithm
Sort
View
EH
2005
IEEE
134views Hardware» more  EH 2005»
14 years 2 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
ICRA
2005
IEEE
135views Robotics» more  ICRA 2005»
14 years 2 months ago
Efficient Closed Contour Extraction from Range Image's Edge Points
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
Angel Domingo Sappa
NETWORKING
2007
13 years 10 months ago
Construction of a Proxy-Based Overlay Skeleton Tree for Large-Scale Real-Time Group Communications
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
Jun Guo, Sanjay Jha
WINET
2008
86views more  WINET 2008»
13 years 8 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 1 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...