165 search results - page 25 / 33 » Auditing Sum Queries |
125
click to vote
SIGECOM
2008
ACM
15 years 1 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
104
click to vote
PODS
2010
ACM
15 years 7 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
114
click to vote
CN
2007
15 years 1 months ago
2007
Self-protecting systems require the ability to instantaneously detect malicious activity at run-time and prevent execution. We argue that it is impossible to perfectly self-protec...
104
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
125
click to vote
ICLP
2010
Springer
15 years 5 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...