Sciweavers

1952 search results - page 350 / 391
» Complete partitions of graphs
Sort
View
AINA
2007
IEEE
15 years 10 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
INFOCOM
2007
IEEE
15 years 10 months ago
Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information
Abstract—We propose a novel algorithm for detecting wormhole attacks in wireless multi-hop networks. The algorithm uses only connectivity information to look for forbidden substr...
Ritesh Maheshwari, Jie Gao, Samir R. Das
INFOCOM
2007
IEEE
15 years 10 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
IPCCC
2007
IEEE
15 years 10 months ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
ISBI
2007
IEEE
15 years 10 months ago
Grafip: A Framework for the Representation of Healthy and Pathological Cerebral Information
This paper presents a contribution to the large problematic of integrating medical image-based information into a structured framework (such as electronic patient records or anato...
Jamal Atif, Céline Hudelot, Olivier Nempont...