Sciweavers

1024 search results - page 84 / 205
» Compositional Methods for Probabilistic Systems
Sort
View
IFIP
2005
Springer
14 years 1 months ago
Probable Innocence Revisited
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...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 8 months ago
Belief state approaches to signaling alarms in surveillance systems
Surveillance systems have long been used to monitor industrial processes and are becoming increasingly popular in public health and anti-terrorism applications. Most early detecti...
Kaustav Das, Andrew W. Moore, Jeff G. Schneider
FMCAD
2006
Springer
13 years 11 months ago
Synchronous Elastic Networks
We formally define--at the stream transformer level--a class of synchronous circuits that tolerate any variability in the latency of their environment. We study behavioral properti...
Sava Krstic, Jordi Cortadella, Michael Kishinevsky...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 8 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
CRIWG
2001
13 years 9 months ago
Evolution in Use of Groupware: Facilitating Tailoring to the Extreme
Group work evolves, often leading to changing requirements on the technical support. To meet these new requirements groupware has to be modified. A system that allows end users to...
Robert Slagter, Margit Biemans, G. Henri ter Hofte