Sciweavers

852 search results - page 7 / 171
» Using graph parsing for automatic graph drawing
Sort
View
ER
2005
Springer
200views Database» more  ER 2005»
14 years 26 days ago
How to Tame a Very Large ER Diagram (Using Link Analysis and Force-Directed Drawing Algorithms)
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
Yannis Tzitzikas, Jean-Luc Hainaut
GD
2003
Springer
14 years 16 days ago
Visualizing Related Metabolic Pathways in Two and a Half Dimensions
We propose a method for visualizing a set of related metabolic pathways using 21 2 D graph drawing. Interdependent, twodimensional layouts of each pathway are stacked on top of eac...
Ulrik Brandes, Tim Dwyer, Falk Schreiber
ICTAI
2006
IEEE
14 years 1 months ago
Graph Grammar Induction on Structural Data for Visual Programming
Computer programs that can be expressed in two or more dimensions are typically called visual programs. The underlying theories of visual programming languages involve graph gramm...
Keven Ates, Jacek P. Kukluk, Lawrence B. Holder, D...
CICLING
2011
Springer
12 years 11 months ago
Identification of Conjunct Verbs in Hindi and Its Effect on Parsing Accuracy
This paper introduces a work on identification of conjunct verbs in Hindi. The paper will first focus on investigating which noun-verb combination makes a conjunct verb in Hindi us...
Rafiya Begum, Karan Jindal, Ashish Jain, Samar Hus...
VLC
2002
93views more  VLC 2002»
13 years 7 months ago
Metrics for Graph Drawing Aesthetics
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
Helen C. Purchase