Sciweavers

599 search results - page 22 / 120
» The repeater tree construction problem
Sort
View
EUROCRYPT
2006
Springer
15 years 1 months ago
A Provable-Security Treatment of the Key-Wrap Problem
Abstract. We give a provable-security treatment for the key-wrap problem, providing definitions, constructions, and proofs. We suggest that key-wrap's goal is security in the ...
Phillip Rogaway, Thomas Shrimpton
COMCOM
2010
246views more  COMCOM 2010»
14 years 8 months ago
Tabu search algorithm for RP selection in PIM-SM multicast routing
: - To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position...
Hua Wang, Xiangxu Meng, Min Zhang, Yanlong Li
ESA
1994
Springer
138views Algorithms» more  ESA 1994»
15 years 1 months ago
Efficient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Sunil Arya, Michiel H. M. Smid
TON
2010
171views more  TON 2010»
14 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
ALGORITHMICA
1999
112views more  ALGORITHMICA 1999»
14 years 9 months ago
Suffix Trees on Words
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...
Arne Andersson, N. Jesper Larsson, Kurt Swanson