Sciweavers

58 search results - page 5 / 12
» How Leaky Is an Extractor
Sort
View
CCS
2006
ACM
14 years 1 months ago
Data collection with self-enforcing privacy
Consider a pollster who wishes to collect private, sensitive data from a number of distrustful individuals. How might the pollster convince the respondents that it is trustworthy?...
Philippe Golle, Frank McSherry, Ilya Mironov
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 4 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
ECOOP
2007
Springer
14 years 4 months ago
Matching Objects with Patterns
Data in object-oriented programming is organized in a hierarchy of classes. The problem of object-oriented pattern matching is how to explore this hierarchy from the outside. This ...
Burak Emir, Martin Odersky, John Williams
INFOCOM
1993
IEEE
14 years 1 months ago
Burstiness Bounds for Some Burst Reducing Servers
In [18], we propose a framework to study a stream of trafic or message as it is transferred over an ATM connection. A message is modeled as a deierministic fluid flow, and an ATM ...
Steven H. Low, Pravin Varaiya
DATE
1997
IEEE
109views Hardware» more  DATE 1997»
14 years 2 months ago
Cartesian multipole based numerical integration for 3D capacitance extraction
Application of the hierarchical Schur algorithm to the boundary element method for 3D capacitance extraction shifts the speed bottleneck from inversion of the influence matrix to...
U. Geigenmüller, N. P. van der Meijs