71 search results - page 11 / 15 » Anonymity in Probabilistic and Nondeterministic Systems |
NIPS
1996
14 years 11 months ago
1996
We present a general encoding-decoding framework for interpreting the activity of a population of units. A standard population code interpretation method, the Poisson model, start...
P2P
2008
IEEE
15 years 4 months ago
2008
IEEE
We introduce transaction rate limiters, new mechanisms that limit (probabilistically) the maximum number of transactions a user of a peer-to-peer system can do in any given period...
SOSP
2009
ACM
15 years 6 months ago
2009
ACM
Bug reproduction is critically important for diagnosing a production-run failure. Unfortunately, reproducing a concurrency bug on multi-processors (e.g., multi-core) is challengin...
87
Voted
AAAI
2007
14 years 12 months ago
2007
This paper describes recent results from the robotics community that develop a theory, similar in spirit to the theory of computation, for analyzing sensor-based agent systems. Th...
IFIP
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we propose a formalization of probable innocence, a notion of probabilistic anonymity that is associated to “realistic” protocols such as Crowds. We analyze crit...