Sciweavers

2128 search results - page 381 / 426
» A general characterization of indulgence
Sort
View
PODC
2006
ACM
14 years 4 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
SIGMETRICS
2006
ACM
14 years 4 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 4 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
WIKIS
2006
ACM
14 years 4 months ago
Foucault@Wiki: first steps towards a conceptual framework for the analysis of Wiki discourses
In this paper, we examine the discursive situation of Wikipedia. The primary goal is to explore principle ways of analyzing and characterizing the various forms of communicative u...
Christian Pentzold, Sebastian Seidenglanz
CODES
2005
IEEE
14 years 3 months ago
Enhancing security through hardware-assisted run-time validation of program data properties
The growing number of information security breaches in electronic and computing systems calls for new design paradigms that consider security as a primary design objective. This i...
Divya Arora, Anand Raghunathan, Srivaths Ravi, Nir...