256 search results - page 36 / 52 » Sparse random graphs with clustering |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
TSP
2008
13 years 7 months ago
2008
Abstract--We present a versatile framework for tractable computation of approximate variances in large-scale Gaussian Markov random field estimation problems. In addition to its ef...
EOR
2010
13 years 7 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
ISMB
1993
13 years 9 months ago
1993
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...