1794 search results - page 151 / 359 » Visualizing Memory Graphs |
121
click to vote
GBRPR
2007
Springer
15 years 10 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
135
click to vote
VIP
2003
15 years 6 months ago
2003
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...
132
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...
134
click to vote
APVIS
2007
15 years 6 months ago
2007
Graphs are typically visualized as node-link diagrams. Although there is a fair amount of research focusing on crossing minimization to improve readability, little attention has b...
161
click to vote
VL
2003
IEEE
15 years 10 months ago
2003
IEEE
Constraint diagrams are a visual notation designed to complement the Unified Modeling Language in the development of software systems. They generalize Venn diagrams and Euler cir...