471 search results - page 67 / 95 » Case studies for self-organization in computer science |
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
TCC
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
ICS
2009
Tsinghua U.
14 years 3 months ago
2009
Tsinghua U.
Iterative stencil loops (ISLs) are used in many applications and tiling is a well-known technique to localize their computation. When ISLs are tiled across a parallel architecture...