7015 search results - page 155 / 1403 » Approximation algorithms for co-clustering |
ICIP
1999
IEEE
14 years 11 months ago
1999
IEEE
This paper presents an iterative algorithm for approximating gray-scale images with adaptive triangular meshes ensuring a given tolerance. At each iteration, the algorithm applies...
ISSAC
2004
Springer
14 years 3 months ago
2004
Springer
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. ...
SODA
1997
ACM
13 years 11 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
JMLR
2010
13 years 4 months ago
2010
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Two approaches have been used to perform approximate inference in Bayesian networks for which exact inference is infeasible: employing an approximation algorithm, or appr...