7015 search results - page 1087 / 1403 » Approximation algorithms for co-clustering |
132
click to vote
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...
126
click to vote
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...
251
click to vote
VLDB
2007
ACM
16 years 4 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...
263
click to vote
VLDB
2007
ACM
16 years 4 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...
145
Voted
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...