Sciweavers

Share
25 search results - page 1 / 5
» nca 2005
Sort
View
NCA
2005
IEEE
9 years 7 months ago
Opening Address
T. Elmer
NCA
2005
IEEE
9 years 7 months ago
Dynamic Quorums for DHT-based P2P Networks
Roberto Baldoni, Leonardo Querzoni, Antonino Virgi...
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
9 years 8 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
NCA
2005
IEEE
9 years 7 months ago
Leveraging the Multiprocessing Capabilities of Modern Network Processors for Cryptographic Acceleration
The Kasumi block cipher provides integrity and confidentiality services for 3G wireless networks, but it also forms a bottleneck due to its computational overhead. Especially in ...
Gunnar Gaubatz, Berk Sunar
NCA
2005
IEEE
9 years 7 months ago
Cooperative Mobile Agents to Gather Global Information
Abstract— This paper describes an original approach to writing reactive algorithms on highly dynamic networks. We propose to use randomly mobile agents to gather global informati...
Michel Charpentier, Gérard Padiou, Philippe...
books