Sciweavers

2473 search results - page 490 / 495
» The Logic of Communication Graphs
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 23 days ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
IMC
2003
ACM
14 years 23 days ago
On inferring and characterizing internet routing policies
Border Gateway Protocol allows Autonomous Systems (ASs) to apply diverse routing policies for selecting routes and for propagating reachability information to other ASs. Although ...
Feng Wang, Lixin Gao
SACMAT
2003
ACM
14 years 23 days ago
The role control center: features and case studies
Role-based Access Control (RBAC) models have been implemented not only in self-contained resource management products such as DBMSs and Operating Systems but also in a class of pr...
David F. Ferraiolo, Ramaswamy Chandramouli, Gail-J...
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 11 hour ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
13 years 12 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla