7015 search results - page 1086 / 1403 » Approximation algorithms for co-clustering |
137
Voted
CAV
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
116
Voted
KDD
2006
ACM
16 years 5 months ago
2006
ACM
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
172
click to vote
KDD
2005
ACM
16 years 5 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...
134
Voted
RECOMB
2008
Springer
16 years 5 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...
131
click to vote
STOC
2005
ACM
16 years 5 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)...