Sciweavers

49 search results - page 2 / 10
» Comparing Graph Layouts for Vertex Selection Tasks
Sort
View
INFOVIS
2003
IEEE
13 years 11 months ago
EdgeLens: An Interactive Method for Managing Edge Congestion in Graphs
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...
Nelson Wong, M. Sheelagh T. Carpendale, Saul Green...
ICCAD
2003
IEEE
188views Hardware» more  ICCAD 2003»
14 years 3 months ago
Communication-Aware Task Scheduling and Voltage Selection for Total Systems Energy Minimization
Abstract: In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent ta...
Girish Varatkar, Radu Marculescu
GD
2006
Springer
13 years 10 months ago
Improved Circular Layouts
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...
Emden R. Gansner, Yehuda Koren
TVCG
2008
134views more  TVCG 2008»
13 years 6 months ago
Balloon Focus: a Seamless Multi-Focus+Context Method for Treemaps
The treemap is one of the most popular methods for visualizing hierarchical data. When a treemap contains a large number of items, inspecting or comparing a few selected items in a...
Ying Tu, Han-Wei Shen
ICML
2006
IEEE
14 years 7 months ago
Graph model selection using maximum likelihood
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
Adam Kalai, Ivona Bezáková, Rahul Sa...