1794 search results - page 19 / 359 » Visualizing Memory Graphs |
120
click to vote
CCCG
2008
15 years 3 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
118
click to vote
SSS
2010
Springer
15 years 20 days ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
106
click to vote
CORR
2000
Springer
15 years 2 months ago
2000
Springer
This paper illustrates how the diagram programming language DIAPLAN can be used to program visual systems. DIAPLAN is a visual rulebased language that is founded on the computation...
115
click to vote
VL
1999
IEEE
15 years 6 months ago
1999
IEEE
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host...
127
click to vote
IPPS
2010
IEEE
15 years 7 days ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...