7015 search results - page 211 / 1403 » Approximation algorithms for co-clustering |
173
click to vote
LATIN
1998
Springer
15 years 10 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
191
click to vote
JSC
2006
15 years 6 months ago
2006
In this paper, we present a new algorithm for the exact solutions of linear systems with integer coefficients using numerical methods. It terminates with the correct answer in wel...
158
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized Page...
164
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
133
click to vote
OPODIS
2004
15 years 7 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...