Sciweavers

852 search results - page 43 / 171
» Using graph parsing for automatic graph drawing
Sort
View
ALENEX
2001
103views Algorithms» more  ALENEX 2001»
13 years 10 months ago
Travel Planning with Self-Made Maps
Speed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilita...
Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thom...
CVPR
2010
IEEE
14 years 4 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
ICTAI
2008
IEEE
14 years 2 months ago
Adaptive Mobile Interfaces through Grammar Induction
This paper presents a grammar-induction based approach to partitioning a Web page into several small pages while each small page fits not only spatially but also logically for mob...
Jun Kong, Kevin L. Ates, Kang Zhang, Yan Gu
ACSD
2007
IEEE
109views Hardware» more  ACSD 2007»
14 years 15 days ago
Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
Victor Khomenko
JGAA
2007
124views more  JGAA 2007»
13 years 8 months ago
Energy Models for Graph Clustering
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
Andreas Noack