Sciweavers

117 search results - page 3 / 24
» Minimizing the Diameter of a Network Using Shortcut Edges
Sort
View
CVPR
2010
IEEE
14 years 2 months ago
Geodesic Graph Cut for Interactive Image Segmentation
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
Brian Price, Bryan Morse, Scott Cohen
ICC
2011
IEEE
257views Communications» more  ICC 2011»
12 years 5 months ago
Increasing the Lifetime of Roadside Sensor Networks Using Edge-Betweenness Clustering
Abstract—Wireless Sensor Networks are proven highly successful in many areas, including military and security monitoring. In this paper, we propose a method to use the edge–bet...
Joakim Flathagen, Ovidiu Valentin Drugan, Paal E. ...
AHSWN
2008
92views more  AHSWN 2008»
13 years 5 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
COCOON
2006
Springer
13 years 9 months ago
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands
We examine how to induce selfish heterogeneous users in a multicommodity network to reach an equilibrium that minimizes the social cost. In the absence of centralized coordination...
George Karakostas, Stavros G. Kolliopoulos
CJ
2010
128views more  CJ 2010»
13 years 5 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...