596 search results - page 85 / 120 » Complexity Analysis by Graph Rewriting |
AINA
2007
IEEE
14 years 2 months ago
2007
IEEE
In hierarchical distributed systems, shared data access can be controlled by assigning user groups single cryptographic keys that allow high level users derive low level keys, but...
DIALM
2004
ACM
14 years 1 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
PODC
2009
ACM
14 years 23 days ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
SEKE
2001
Springer
14 years 16 days ago
2001
Springer
Source code analysis and inspection does not provide enough information to describe the structure of an objectoriented program completely because there are components and relation...
VLDB
1990
ACM
14 years 3 days ago
1990
ACM
Therequirementsfor amain memorydatastoragemodel are both compactnessand efficient processing for all database operations. The DBGraph storage model, proposed in this paper, achiev...