Sciweavers

165 search results - page 25 / 33
» A New Algorithm for On-line Coloring Bipartite Graphs
Sort
View
IWPEC
2004
Springer
14 years 1 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
JCP
2008
135views more  JCP 2008»
13 years 7 months ago
Hybrid Evolutionary Algorithm Based Solution for Register Allocation for Embedded Systems
Embedded systems have an ever-increasing need for optimizing compilers to produce high quality codes with a limited general purpose register set. Either memory or registers are use...
Anjali Mahajan, M. S. Ali
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 2 months ago
A new approach to nonrepetitive sequences
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
33
Voted

Publication
400views
13 years 2 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...
ICIP
2009
IEEE
13 years 5 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