Sciweavers

1404 search results - page 19 / 281
» Complexity of admissible rules
Sort
View
TSP
2010
13 years 5 months ago
Algorithms for Complex ML ICA and Their Stability Analysis Using Wirtinger Calculus
Abstract--We derive a class of algorithms for independent component analysis (ICA) based on maximum likelihood (ML) estimation and perform stability analysis of natural gradient ML...
Hualiang Li, Tülay Adali
TLCA
1995
Springer
14 years 1 months ago
Typed Operational Semantics
operator abstraction is a language construct relevant to object oriented programming languages and to ML2000, the successor to Standard ML. In this paper, we introduce Fω ≤, a ...
Healfdene Goguen
AIML
2006
13 years 11 months ago
Deep Sequent Systems for Modal Logic
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference ...
Kai Brünnler
SYNASC
2007
IEEE
119views Algorithms» more  SYNASC 2007»
14 years 4 months ago
Graph Rewriting and Strategies for Modeling Biochemical Networks
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
Oana Andrei, Hélène Kirchner
IGPL
2007
74views more  IGPL 2007»
13 years 10 months ago
The Rules of Logic Composition for the Bayesian Epistemic e-Values
In this paper, the relationship between the e-value of a complex hypothesis, H, and those of its constituent elementary hypotheses, Hj
Wagner Borges, Julio Michael Stern