Sciweavers

279 search results - page 32 / 56
» Degree-bounded minimum spanning trees
Sort
View
AINA
2008
IEEE
13 years 9 months ago
An Efficient Tree Structure for Delay Sensitive Data Gathering in Wireless Sensor Networks
It is important to design an energy efficient data gathering tree structure for wireless sensor networks. As for the energy efficiency, network's overall energy consumption an...
Soonmok Kwon, Jeonggyu Kim, Cheeha Kim
APPINF
2003
13 years 8 months ago
Corner-First Tree-based Region Broadcasting in Mesh Networks
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
Hadeel Haddad, Muhammad F. Mudawwar
ADHOCNETS
2010
Springer
13 years 5 months ago
Balanced Itinerary Planning for Multiple Mobile Agents in Wireless Sensor Networks
In this paper, we consider the use of multiple mobile software agents to perform different tasks in wireless sensor networks (WSNs). To this regard, determining the number of mobil...
Min Chen, Wei Cai, Sergio González-Valenzue...
ICIP
2008
IEEE
14 years 1 months ago
Augmented tree partitioning for interactive image segmentation
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
Yangqing Jia, Jingdong Wang, Changshui Zhang, Xian...
TCAD
2002
128views more  TCAD 2002»
13 years 7 months ago
Preferred direction Steiner trees
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
Mehmet Can Yildiz, Patrick H. Madden