Sciweavers

638 search results - page 53 / 128
» Track Layouts of Graphs
Sort
View
CORR
2012
Springer
249views Education» more  CORR 2012»
13 years 5 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...
CVPR
2009
IEEE
16 years 5 months ago
Pose Search: retrieving people using their pose
We describe a method for retrieving shots containing a particular 2D human pose from unconstrained movie and TV videos. The method involves first localizing the spatial layout o...
Andrew Zisserman, Manuel J. Marín-Jim&eacut...
ASUNAM
2010
IEEE
14 years 11 months ago
Tracking the Evolution of Communities in Dynamic Social Networks
Real-world social networks from a variety of domains can naturally be modelled as dynamic graphs. However, approaches to detecting communities have largely focused on identifying ...
Derek Greene, Dónal Doyle, Padraig Cunningh...
WWW
2010
ACM
15 years 4 months ago
Tracking the random surfer: empirically measured teleportation parameters in PageRank
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
David F. Gleich, Paul G. Constantine, Abraham D. F...
VISSOFT
2005
IEEE
15 years 3 months ago
Exploring Relations within Software Systems Using Treemap Enhanced Hierarchical Graphs
The clear and meaningful visualization of relations between software entities is an invaluable tool for the comprehension, evaluation, and reengineering of the structure of existi...
Michael Balzer, Oliver Deussen