Sciweavers

11 search results - page 2 / 3
» Orthogonal Concatenation: Language Equations and State Compl...
Sort
View
EACL
2003
ACL Anthology
13 years 6 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä
JCNS
2010
100views more  JCNS 2010»
13 years 3 months ago
Morphologically accurate reduced order modeling of spiking neurons
Accurately simulating neurons with realistic morphological structure and synaptic inputs requires the solution of large systems of nonlinear ordinary differential equations. We ap...
Anthony R. Kellems, Saifon Chaturantabut, Danny C....
DISCO
1993
156views Hardware» more  DISCO 1993»
13 years 9 months ago
Variant Handling, Inheritance and Composition in the ObjectMath Computer Algebra Environment
ObjectMath is a high-level programming environment and modeling language for scientific computing which supports variants and graphical browsing in the environment and integrates o...
Peter Fritzson, Vadim Engelson, Lars Viklund
CDC
2009
IEEE
185views Control Systems» more  CDC 2009»
13 years 10 months ago
Discrete Empirical Interpolation for nonlinear model reduction
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...
Saifon Chaturantabut, Danny C. Sorensen
LOPSTR
2005
Springer
13 years 10 months ago
Declarative Programming with Function Patterns
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
Sergio Antoy, Michael Hanus