Sciweavers

852 search results - page 38 / 171
» Using graph parsing for automatic graph drawing
Sort
View
NAACL
2007
13 years 10 months ago
Worst-Case Synchronous Grammar Rules
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
Daniel Gildea, Daniel Stefankovic
VL
2008
IEEE
115views Visual Languages» more  VL 2008»
14 years 2 months ago
Flexible visualization of automatic simulation based on structured graph transformation
Visual modeling languages for discrete behavior modeling allow the modeler to describe how systems develop over time during system runs. Models of these languages are the basis fo...
Enrico Biermann, Claudia Ermel, Jonas Hurrelmann, ...
MFCS
2007
Springer
14 years 2 months ago
Traces of Term-Automatic Graphs
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
Antoine Meyer
MIR
2006
ACM
200views Multimedia» more  MIR 2006»
14 years 2 months ago
An adaptive graph model for automatic image annotation
Automatic keyword annotation is a promising solution to enable more effective image search by using keywords. In this paper, we propose a novel automatic image annotation method b...
Jing Liu, Mingjing Li, Wei-Ying Ma, Qingshan Liu, ...
CLA
2004
13 years 10 months ago
Planarity of Additively Drawn Concept Lattices
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
Christian Zschalig