Sciweavers

656 search results - page 18 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
SCP
2008
91views more  SCP 2008»
14 years 9 months ago
Stable, flexible, peephole pretty-printing
Programmers working on large software systems are faced with an extremely complex, information-rich environment. To help navigate through this, modern development environments all...
Stoney Jackson, Premkumar T. Devanbu, Kwan-Liu Ma
JGAA
2007
87views more  JGAA 2007»
14 years 9 months ago
A 2.5D Hierarchical Drawing of Directed Graphs
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarass...
SIGIR
2009
ACM
15 years 4 months ago
Dynamicity vs. effectiveness: studying online clustering for scatter/gather
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...
Weimao Ke, Cassidy R. Sugimoto, Javed Mostafa
IV
2007
IEEE
111views Visualization» more  IV 2007»
15 years 3 months ago
Geographic Routing on Improved Coordinates
We consider routing methods for networks when geographic positions of nodes are available. Instead of using the original geographic coordinates, however, we precompute virtual coo...
Ulrik Brandes, Daniel Fleischer
IPM
2008
123views more  IPM 2008»
14 years 9 months ago
Effectiveness of additional representations for the search result presentation on the web
The presentation of search results on the web has been dominated by the textual form of document representation. On the other hand, the document's visual aspects such as the ...
Hideo Joho, Joemon M. Jose