4037 search results - page 86 / 808 » Routing without ordering |
BDA
2007
13 years 10 months ago
2007
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffi...
IJISTA
2010
13 years 7 months ago
2010
- Over the last few years, Pervasive Computing has become a very active research topic in both academia and industry. In spite of its undeniable benefit, until recently, the wide d...
MOBIHOC
2009
ACM
14 years 9 months ago
2009
ACM
Finding data items is one of the most basic services of any distributed system. It is particular challenging in ad-hoc networks, due to their inherent decentralized nature and lac...
ICCSA
2007
Springer
14 years 3 months ago
2007
Springer
An encrypted email is sent from Bob to Alice. A gateway wants to check whether a certain keyword exists in an email or not for some reason (e.g. routing). Nevertheless Alice does n...
POPL
1993
ACM
14 years 1 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...