Sciweavers

222 search results - page 8 / 45
» E-Matching with Free Variables
Sort
View
LPAR
2010
Springer
13 years 6 months ago
How to Universally Close the Existential Rule
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...
Kai Brünnler
CCECE
2006
IEEE
14 years 1 months ago
Absolutely Free Extrinsic Evolution of Passive Low-Pass Filter
Evolutionary electronics is a brunch of Evolvable Hardware, where the Evolutionary Algorithm is applied towards electronic circuits. The success ofevolutionary search most of all ...
Yerbol Sapargaliyev, Tatiana Kalganova
FLAIRS
2003
13 years 9 months ago
MDL-Based Context-Free Graph Grammar Induction
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biase...
Istvan Jonyer, Lawrence B. Holder, Diane J. Cook
JAR
2008
88views more  JAR 2008»
13 years 7 months ago
Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables
Statistical quantities, such as expectation (mean) and variance, play a vital role in the present age probabilistic analysis. In this paper, we present some formalization of expect...
Osman Hasan, Sofiène Tahar
ICASSP
2008
IEEE
14 years 2 months ago
A GIS-like training algorithm for log-linear models with hidden variables
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...
Georg Heigold, Thomas Deselaers, Ralf Schlüte...