4622 search results - page 150 / 925 » Foundations of Information Theory |
197
click to vote
INFOCOM
2006
IEEE
16 years 18 days ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
196
click to vote
EMSOFT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
201
click to vote
CCS
2011
ACM
14 years 6 months ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
114
click to vote
APAL
2010
15 years 6 months ago
2010
Computability theory concerns information with a causal
183
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...