4007 search results - page 592 / 802 » Computation with imprecise probabilities |
151
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
124
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
111
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract In a load balancing network each processor has an initial collection of unit-size jobs, tokens, and in each round, pairs of processors connected by balancers split their l...
201
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by...
222
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...