Sciweavers

776 search results - page 4 / 156
» Network Applications of Graph Bisimulation
Sort
View
ICDAR
2011
IEEE
12 years 9 months ago
Subgraph Spotting through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
Muhammad Muzzamil Luqman, Jean-Yves Ramel, Josep L...
SPAA
2005
ACM
14 years 3 months ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder
IPL
2011
63views more  IPL 2011»
13 years 4 months ago
Edge-colored graphs with applications to homogeneous faults
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
Yongge Wang, Yvo Desmedt
ISSTA
2012
ACM
12 years 7 days ago
Finding errors in multithreaded GUI applications
To keep a Graphical User Interface (GUI) responsive and active, a GUI application often has a main UI thread (or event dispatching thread) and spawns separate threads to handle le...
Sai Zhang, Hao Lü, Michael D. Ernst
CHI
2010
ACM
14 years 4 months ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon