Sciweavers

8094 search results - page 152 / 1619
» Improvements in Formula Generalization
Sort
View
TABLEAUX
1999
Springer
14 years 1 months ago
Merge Path Improvements for Minimal Model Hyper Tableaux
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...
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 10 months ago
Improved bounds on the sample complexity of learning
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...
Yi Li, Philip M. Long, Aravind Srinivasan
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
14 years 28 days ago
An Improved Construction for Counting Bloom Filters
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...
CDC
2008
IEEE
123views Control Systems» more  CDC 2008»
14 years 3 months ago
Fast state estimation in linear time-varying systems: An algebraic approach
— 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...
Yang Tian, Thierry Floquet, Wilfrid Perruquetti
ASIACRYPT
2005
Springer
14 years 2 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
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...
Vladimir Kolesnikov