Sciweavers

762 search results - page 99 / 153
» Strategic Coloring of a Graph
Sort
View
EJC
2007
15 years 4 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
15 years 2 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
PPOPP
2010
ACM
16 years 1 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
ICALP
2009
Springer
16 years 4 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
14 years 11 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...