Sciweavers

1155 search results - page 191 / 231
» Elaborating Domain Descriptions
Sort
View
ECEASST
2008
88views more  ECEASST 2008»
13 years 10 months ago
Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
Steffen Mazanek, Mark Minas
AIEDU
2006
77views more  AIEDU 2006»
13 years 10 months ago
Constraint-based Modeling and Ambiguity
Constraint-based modeling has been used in many application areas of Intelligent Tutoring Systems as a powerful means to analyse erroneous student solutions and generate helpful fe...
Wolfgang Menzel
ENTCS
2008
120views more  ENTCS 2008»
13 years 10 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier
ENTCS
2008
120views more  ENTCS 2008»
13 years 10 months ago
Towards a Quantum Calculus: (Work in Progress, Extended Abstract)
Progress, Extended Abstract) Philippe Jorrand1 Simon Perdrix2 Leibniz Laboratory IMAG-INPG Grenoble, France The aim of this paper is to introduce a general model of quantum comput...
Philippe Jorrand, Simon Perdrix
CVIU
2006
105views more  CVIU 2006»
13 years 10 months ago
The representation and matching of categorical shape
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated part...
Ali Shokoufandeh, Lars Bretzner, Diego Macrini, M....