Sciweavers

720 search results - page 97 / 144
» Nonrepetitive colorings of graphs
Sort
View
EJC
2007
13 years 7 months ago
Link complexes of subspace arrangements
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...
Axel Hultman
SOFTVIS
2010
ACM
13 years 6 months ago
Visual comparison of software architectures
Reverse engineering methods produce different descriptions of software architectures. In this work we analyze and define the task of exploring and comparing these descriptions. ...
Fabian Beck, Stephan Diehl
ICALP
2009
Springer
14 years 8 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh

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...
ACCV
2007
Springer
14 years 1 months ago
Image Segmentation Using Iterated Graph Cuts Based on Multi-scale Smoothing
We present a novel approach to image segmentation using iterated Graph Cuts based on multi-scale smoothing. We compute the prior probability obtained by the likelihood from a color...
Tomoyuki Nagahashi, Hironobu Fujiyoshi, Takeo Kana...