Sciweavers

Share
JCAM
2010
93views more  JCAM 2010»
8 years 4 months ago
Singular-value-like decomposition for complex matrix triples
The classical singular value decomposition for a matrix A Cm
Christian Mehl, Volker Mehrmann, Hongguo Xu
TNN
1998
99views more  TNN 1998»
8 years 8 months ago
Comments on local minima free conditions in multilayer perceptrons
—In this letter we point out that multilayer neural networks (MLP’s) with either sigmoidal units or radial basis functions can be given a canonical form with positive interunit...
Marco Gori, Ah Chung Tsoi
IJON
1998
119views more  IJON 1998»
8 years 9 months ago
Comment on "Recurrent neural networks: A constructive algorithm, and its properties"
In their paper [1], Tsoi and Tan present what they call a "canonical form", which they claim to be identical to that proposed in Nerrand et al [2]. They also claim that ...
Léon Personnaz, Gérard Dreyfus
PLANX
2007
8 years 10 months ago
Deciding Equivalence of Top-Down XML Transformations in Polynomial Time
Many useful XML transformations can be formulated through deterministic top-down tree transducers. A canonical form for such transducers is presented which allows to decide equiva...
Sebastian Maneth, Helmut Seidl
CSR
2008
Springer
8 years 11 months ago
From Invariants to Canonization in Parallel
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
Johannes Köbler, Oleg Verbitsky
CDC
2009
IEEE
143views Control Systems» more  CDC 2009»
9 years 16 days ago
Extended nonlinear observable canonical form for multi-output dynamical systems
— In this paper, we give sufficient conditions which guarantee the existence of a diffeomorphism in an extended state space that allows to transform a multi-output nonlinear dyn...
Driss Boutat, Krishna Busawon
ESOP
2001
Springer
9 years 1 months ago
Modeling an Algebraic Stepper
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...
John Clements, Matthew Flatt, Matthias Felleisen
SAC
2004
ACM
9 years 2 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
CDC
2008
IEEE
121views Control Systems» more  CDC 2008»
9 years 3 months ago
Lossless scalar functions: Boundary interpolation, Schur algorithm and Ober's canonical form
Abstract— In [1] a balanced canonical form for continuoustime lossless systems was presented. This form has a tridiagonal dynamical matrix A and the useful property that the corr...
Martine Olivi, Bernard Hanzon, Ralf L. M. Peeters
CADE
2003
Springer
9 years 9 months ago
Canonization for Disjoint Unions of Theories
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...
Sava Krstic, Sylvain Conchon
books