Sciweavers

9 search results - page 1 / 2
» Path Visualization for Adjacency Matrices
Sort
View
VISSYM
2007
13 years 7 months ago
Path Visualization for Adjacency Matrices
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far ...
Zeqian Shen, Kwan-Liu Ma
INTERACT
2007
13 years 6 months ago
MatLink: Enhanced Matrix Visualization for Analyzing Social Networks
Abstract. Visualizing social networks presents challeges for both nodelink and adjacency matrix representations. Social networks are locally dense, which makes node-link displays u...
Nathalie Henry, Jean-Daniel Fekete
3DPVT
2006
IEEE
194views Visualization» more  3DPVT 2006»
13 years 10 months ago
Histogram Matching for Camera Pose Neighbor Selection
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....
Kevin L. Steele, Parris K. Egbert, Bryan S. Morse
WWW
2011
ACM
12 years 11 months ago
OntoTrix: a hybrid visualization for populated ontologies
Most Semantic Web data visualization tools structure the representation according to the concept definitions and interrelations that constitute the ontology’s vocabulary. Insta...
Benjamin Bach, Emmanuel Pietriga, Ilaria Liccardi,...
FCT
2007
Springer
13 years 6 months ago
On the Complexity of Kings
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tan...