Sciweavers

29 search results - page 6 / 6
» Graph parsing with s-graph grammars
Sort
View
NLP
2000
13 years 10 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
TAGT
1998
Springer
162views Graph Theory» more  TAGT 1998»
13 years 10 months ago
Hypergraphs as a Uniform Diagram Representation Model
When working with diagrams in visual environments like graphical diagram editors, diagrams have to be represented by an internal model. Graphs and hypergraphs are well-known concep...
Mark Minas
ESSLLI
1999
Springer
13 years 10 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann
DOLAP
2000
ACM
13 years 10 months ago
Automatically Generating OLAP Schemata from Conceptual Graphical Models
Generating tool specific schemata and configuration information for OLAP database tools from conceptual graphical models is an important prerequisite for a comprehensive tool supp...
Karl Hahn, Carsten Sapia, Markus Blaschka