7015 search results - page 170 / 1403 » Approximation algorithms for co-clustering |
ECRTS
2004
IEEE
14 years 1 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
CAGD
2005
13 years 9 months ago
2005
In this paper we present an algorithm for parametrizing approximate algebraic surfaces by lines. The algorithm is applicable to -irreducible algebraic surfaces of degree d having ...
SIAMDM
2000
13 years 9 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
WADS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
SWAT
1994
Springer
14 years 1 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...