Sciweavers

502 search results - page 54 / 101
» Verifying Balanced Trees
Sort
View
TON
2010
171views more  TON 2010»
13 years 4 months ago
Constructing Maximum-Lifetime Data-Gathering Forests in Sensor Networks
Abstract--Energy efficiency is critical for wireless sensor networks. The data-gathering process must be carefully designed to conserve energy and extend network lifetime. For appl...
Yan Wu, Zhoujia Mao, Sonia Fahmy, Ness B. Shroff
PODC
2005
ACM
14 years 3 months ago
Proof labeling schemes
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
Amos Korman, Shay Kutten, David Peleg
TSMC
2008
100views more  TSMC 2008»
13 years 9 months ago
Instruction-Matrix-Based Genetic Programming
In genetic programming (GP), evolving tree nodes separately would reduce the huge solution space. However, tree nodes are highly interdependent with respect to their fitness. In th...
Gang Li, Jin Feng Wang, Kin-Hong Lee, Kwong-Sak Le...
ICDCS
2009
IEEE
14 years 7 months ago
m-LIGHT: Indexing Multi-Dimensional Data over DHTs
In this paper, we study the problem of indexing multidimensional data in the P2P networks based on distributed hash tables (DHTs). We identify several design issues and propose a ...
Yuzhe Tang, Jianliang Xu, Shuigeng Zhou, Wang-Chie...
GLOBECOM
2006
IEEE
14 years 4 months ago
Building A Monitoring Overlay for Peer-to-Peer Streaming
— Current peer-to-peer (P2P) streaming systems often assume that nodes are cooperative to upload and download data. However, in the open environment of the Internet, this is not ...
Xing Jin, Qiuyan Xia, S.-H. Gary Chan