1064 search results - page 112 / 213 » Single Tree Grammars |
154
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
168
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
156
click to vote
COMCOM
2006
15 years 6 months ago
2006
Rapid growth of the Internet traffic requires more bandwidth and high-speed packet processing in the Internet routers. As one of the major packet processing performed in routers, ...
199
click to vote
NETWORKING
2011
14 years 9 months ago
2011
Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Intern...
184
click to vote
ICNP
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...