Sciweavers

576 search results - page 86 / 116
» The Java Syntactic Extender
Sort
View
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 7 months ago
Context-Sensitive Languages, Rational Graphs and Determinism
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
Arnaud Carayol, Antoine Meyer
MVA
2006
205views Computer Vision» more  MVA 2006»
13 years 7 months ago
Ontological inference for image and video analysis
Abstract This paper presents an approach to designing and implementing extensible computational models for perceiving systems based on a knowledge-driven joint inference approach. ...
Christopher Town
LOGCOM
2007
59views more  LOGCOM 2007»
13 years 7 months ago
Forgetting Literals with Varying Propositional Symbols
Recently, the old logical notion of forgetting propositional symbols (or reducing the logical vocabulary) has been generalized to a new notion: forgetting literals. The aim was to...
Yves Moinard
SAJ
2000
101views more  SAJ 2000»
13 years 7 months ago
Algebraic results for structured operational semantics
This paper presents algebraic results that are important for the extended tyft/tyxt format [12, 13] which can be used to describe many different process algebras. This format is b...
Vashti C. Galpin
MST
2007
168views more  MST 2007»
13 years 7 months ago
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Milad Niqui