332 search results - page 47 / 67 » An Aristotelian notion of size |
159
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
139
click to vote
CCS
2010
ACM
16 years 28 days ago
2010
ACM
In an attribute-based signature (ABS), users sign messages with any predicate of their attributes issued from an attribute authority. Under this notion, a signature attests not to...
184
Voted
CIKM
2009
Springer
16 years 20 days ago
2009
Springer
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
204
Voted
COCO
2009
Springer
16 years 20 days ago
2009
Springer
—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...
139
click to vote
FSTTCS
2009
Springer
16 years 20 days ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...