7930 search results - page 1267 / 1586 » Greedy in Approximation Algorithms |
192
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
151
click to vote
RECOMB
2008
Springer
16 years 6 months ago
2008
Springer
We developed Gr?mlin 2.0, a new multiple network aligner with (1) a novel scoring function that can use arbitrary features of a multiple network alignment, such as protein deletion...
149
Voted
STOC
2005
ACM
16 years 6 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)...
155
click to vote
STOC
2003
ACM
16 years 6 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...
143
click to vote
STOC
2001
ACM
16 years 6 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...