Sciweavers

801 search results - page 65 / 161
» Minimal Locked Trees
Sort
View
MOBIDE
2010
ACM
15 years 6 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
NETWORKS
2010
15 years 4 months ago
Fixed-parameter tractability results for full-degree spanning tree and its dual
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
ICIP
2000
IEEE
16 years 8 months ago
Image Registration with Minimum Spanning Tree Algorithm
Registration is a fundamental task in image processing and quite a few registration techniques have been developed in various fields. In this paper we propose a novel graphreprese...
Bing Ma, Alfred O. Hero III, John D. Gorman, Olivi...
INFOCOM
2008
IEEE
16 years 23 days ago
BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks
Abstract—In order to improve scalability and reduce maintenance overhead for structured Peer-to-Peer systems, researchers design optimal architectures with constant degree and lo...
Deke Guo, Yunhao Liu, Xiang-Yang Li
ICT
2004
Springer
120views Communications» more  ICT 2004»
15 years 11 months ago
Scalable End-to-End Multicast Tree Fault Isolation
We present a novel protocol, M3L, for multicast tree fault isolation based purely upon end-to-end information. Here, a fault is a link with a loss rate exceeding a specified thres...
Timur Friedman, Donald F. Towsley, James F. Kurose