Sciweavers

113 search results - page 11 / 23
» A Fast Multi-scale Method for Drawing Large Graphs
Sort
View
ICASSP
2010
IEEE
13 years 6 months ago
Random attributed graphs for statistical inference from content and context
Coping with Information Overload is a major challenge of the 21st century. Huge volumes and varieties of multilingual data must be processed to extract salient information. Previo...
Allen L. Gorin, Carey E. Priebe, John Grothendieck
GD
2006
Springer
13 years 11 months ago
Integrating Edge Routing into Force-Directed Layout
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
Tim Dwyer, Kim Marriott, Michael Wybrow
TVCG
2012
196views Hardware» more  TVCG 2012»
11 years 10 months ago
Ambiguity-Free Edge-Bundling for Interactive Graph Visualization
—Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational datasets (e.g., transportation networks, ...
Sheng-Jie Luo, Chun-Liang Liu, Bing-Yu Chen, Kwan-...
DEXA
2004
Springer
136views Database» more  DEXA 2004»
14 years 27 days ago
PC-Filter: A Robust Filtering Technique for Duplicate Record Detection in Large Databases
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, Han L...
BMCBI
2010
117views more  BMCBI 2010»
13 years 7 months ago
Automatic, context-specific generation of Gene Ontology slims
Background: The use of ontologies to control vocabulary and structure annotation has added value to genomescale data, and contributed to the capture and re-use of knowledge across...
Melissa J. Davis, Muhammad Shoaib B. Sehgal, Mark ...