2446 search results - page 89 / 490 » Choiceless Polynomial Time |
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP ...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
PODS
2003
ACM
14 years 9 months ago
2003
ACM
We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a ...
PODS
2004
ACM
14 years 9 months ago
2004
ACM
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...