Sciweavers

1794 search results - page 28 / 359
» Visualizing Memory Graphs
Sort
View
GD
2004
Springer
15 years 7 months ago
A Note on the Self-similarity of Some Orthogonal Drawings
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
Maurizio Patrignani
84
Voted
ACL
2000
15 years 3 months ago
Memory-Efficient and Thread-Safe Quasi-Destructive Graph Unification
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the me...
Marcel P. van Lohuizen
113
Voted
DAM
2008
69views more  DAM 2008»
15 years 2 months ago
Impact of memory size on graph exploration capability
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
IV
2003
IEEE
116views Visualization» more  IV 2003»
15 years 7 months ago
Visualization of Semantic Metadata and Ontologies
Implicit information embedded in semantic web graphs, such as topography, clusters, and disconnected subgraphs is difficult to extract from text files. Visualizations of the graph...
Paul Mutton, Jennifer Golbeck
109
Voted
DISOPT
2006
90views more  DISOPT 2006»
15 years 2 months ago
Tree decompositions of graphs: Saving memory in dynamic programming
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann