7015 search results - page 285 / 1403 » Approximation algorithms for co-clustering |
180
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
152
click to vote
ICPR
2010
IEEE
16 years 1 months ago
2010
IEEE
In this paper, we present a fast and accurate approximation of the Euclidean opening function which is a wide-used tool in morphological mathematics to analyze binary shapes since...
159
click to vote
ATVA
2005
Springer
16 years 6 days ago
2005
Springer
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel extends Esterel with a noninstantaneous jump instruction (compatible with conc...
161
Voted
COCO
2005
Springer
16 years 5 days ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
226
click to vote
ISAAC
2005
Springer
16 years 4 days ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...