Sciweavers

2487 search results - page 97 / 498
» Partitions of Graphs into Trees
Sort
View
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 3 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
ICIP
1999
IEEE
14 years 11 months ago
A Toolbox for Interactive Segmentation Based on Nested Partitions
This paper presents a toolbox for interactive image segmentation based on a series of nested partitions of increasing coarseness. The user can navigate among the different resolut...
M. Francisca Zanoguera, Beatriz Marcotegui, Fernan...
CIAC
2010
Springer
258views Algorithms» more  CIAC 2010»
14 years 7 months ago
A Planar Linear Arboricity Conjecture
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
Marek Cygan, Lukasz Kowalik, Borut Luzar
COLT
2004
Springer
14 years 3 months ago
On the Convergence of Spectral Clustering on Random Samples: The Normalized Case
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...
ICIP
2005
IEEE
14 years 11 months ago
Detection of semantic objects using description graphs
This paper presents a technique to detect instances of classes (objects) according to their semantic definition in the form of a Description Graph. Classes are defined as combinat...
Ferran Marqués, Xavier Giro