We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
Peter Baumgartner, Joseph Douglas Horton, Bruce Sp...
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
— In this note, an algebraic approach for state estimation of linear time-varying (LTV) systems is introduced. This approach is based on the following mathematical tools: Laplace...
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...