Sciweavers

505 search results - page 43 / 101
» On A Graph Formalism for Ordered Edges
Sort
View
ICDAR
2011
IEEE
13 years 9 months ago
A Method of Evaluating Table Segmentation Results Based on a Table Image Ground Truther
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...
Yanhui Liang, Yizhou Wang, Eric Saund
EACL
1993
ACL Anthology
14 years 11 months ago
Disjunctions and Inheritance in the Context Feature Structure System
Substantial efforts have been made in order to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; DSrre and Eisele, 1990]...
Martin Böttcher
FM
1999
Springer
161views Formal Methods» more  FM 1999»
15 years 2 months ago
On-the-Fly Controller Synthesis for Discrete and Dense-Time Systems
We present novel techniques for efficient controller synthesis for untimed and timed systems with respect to invariance and reachability properties. In the untimed case, we give al...
Stavros Tripakis, Karine Altisen
ORDER
2006
97views more  ORDER 2006»
14 years 9 months ago
Upward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
Vida Dujmovic, David R. Wood
SAC
2010
ACM
15 years 2 months ago
An algorithm to generate the context-sensitive synchronized control flow graph
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
Marisa Llorens, Javier Oliver, Josep Silva, Salvad...