7015 search results - page 193 / 1403 » Approximation algorithms for co-clustering |
173
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
159
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
237
click to vote
ARITH
2011
IEEE
14 years 6 months ago
2011
IEEE
—We consider the problem of short division — i.e., approximate quotient — of multiple-precision integers. We present ready-to-implement algorithms that yield an approximation...
181
click to vote
ICASSP
2008
IEEE
16 years 27 days ago
2008
IEEE
In this paper we propose novel algorithms for image restoration and parameter estimation with a Generalized Gaussian Markov Random Field prior utilizing variational distribution a...
265
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...