Sciweavers

367 search results - page 49 / 74
» A memetic algorithm for graph coloring
Sort
View
IWPEC
2004
Springer
14 years 2 months ago
Online Problems, Pathwidth, and Persistence
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
Rodney G. Downey, Catherine McCartin
COMPGEOM
2006
ACM
14 years 2 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin

Publication
400views
13 years 3 months ago
Partitioning Histopathological Images: An Integrated Framework for Supervised Color-Texture Segmentation and Cell Splitting
For quantitative analysis of histopathological images, such as the lymphoma grading systems, quantification of features is usually carried out on single cells before categorizing...
Hui Kong, Metin Gurcan, and Kamel Belkacem-Boussai...
BMCBI
2011
13 years 3 months ago
Hierarchical graphs for rule-based modeling of biochemical systems
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
Nathan W. Lemons, Bin Hu, William S. Hlavacek
ICIP
2009
IEEE
13 years 6 months ago
A hierarchical graph-based markovian clustering approach for the unsupervised segmentation of textured color images
In this paper, a new unsupervised hierarchical approach to textured color images segmentation is proposed. To this end, we have designed a two-step procedure based on a grey-scale...
Rachid Hedjam, Max Mignotte