Sciweavers

12334 search results - page 2351 / 2467
» The Use of C
Sort
View
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
15 years 3 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
SWS
2004
ACM
15 years 3 months ago
Trust but verify: authorization for web services
Through web service technology, distributed applications can be built in a exible manner, bringing tremendous power to applications on the web. However, this exibility poses sig...
Christian Skalka, Xiaoyang Sean Wang
VRST
2004
ACM
15 years 3 months ago
The MORGAN framework: enabling dynamic multi-user AR and VR projects
The availability of a suitable framework is of vital importance for the development of Augmented Reality (AR) and Virtual Reality (VR) projects. While features such as scalability...
Jan Ohlenburg, Iris Herbst, Irma Lindt, Torsten Fr...
WWW
2004
ACM
15 years 3 months ago
Flexible on-device service object replication with replets
An increasingly large amount of such applications employ service objects such as Servlets to generate dynamic and personalized content. Existing caching infrastructures are not we...
Dong Zhou, Nayeem Islam, Ali Ismael
BIRTHDAY
2004
Springer
15 years 3 months ago
A Trace Semantics for Long-Running Transactions
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
Michael J. Butler, C. A. R. Hoare, Carla Ferreira
« Prev « First page 2351 / 2467 Last » Next »