Sciweavers

3913 search results - page 354 / 783
» complexity 2006
Sort
View
CADE
2006
Springer
16 years 7 months ago
Specifying and Reasoning About Dynamic Access-Control Policies
Access-control policies have grown from simple matrices to non-trivial specifications written in sophisticated languages. The increasing complexity of these policies demands corres...
Daniel J. Dougherty, Kathi Fisler, Shriram Krishna...
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
16 years 7 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
16 years 7 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
OSDI
2006
ACM
16 years 7 months ago
A Modular Network Layer for Sensornets
An overall sensornet architecture would help tame the increasingly complex structure of wireless sensornet software and help foster greater interoperability between different code...
Cheng Tien Ee, Rodrigo Fonseca, Sukun Kim, Daekyeo...
SIGMOD
2006
ACM
170views Database» more  SIGMOD 2006»
16 years 7 months ago
Energy-efficient monitoring of extreme values in sensor networks
Monitoring extreme values (MAX or MIN) is a fundamental problem in wireless sensor networks (and in general, complex dynamic systems). This problem presents very different algorit...
Adam Silberstein, Jun Yang 0001, Kamesh Munagala