138 search results - page 1 / 28 » Algorithms for induced biclique optimization problems |
IPL
2011
12 years 11 months ago
2011
COLOGNETWENTE
2010
13 years 1 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper studies the inducement of sequentiality in genetic algorithms (GAs) for uniformly-scaled problems. Sequentiality is a phenomenon in which sub-solutions converg...