7129 search results - page 1100 / 1426 » Approximation Algorithms for Treewidth |
120
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
121
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
117
Voted
STOC
2001
ACM
16 years 4 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
236
Voted
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
245
Voted
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...