Sciweavers

2905 search results - page 35 / 581
» Formal Memetic Algorithms
Sort
View
ACL
2008
13 years 10 months ago
Regular Tree Grammars as a Formalism for Scope Underspecification
We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel a...
Alexander Koller, Michaela Regneri, Stefan Thater
ACL
1997
13 years 10 months ago
Compiling Regular Formalisms with Rule Features into Finite-State Automata
This paper presents an algorithm for the compilation of regular formalisms with rule features into finite-state automata. Rule features are incorporated into the right context of ...
George Anton Kiraz
JMLR
2012
11 years 11 months ago
Bayesian Comparison of Machine Learning Algorithms on Single and Multiple Datasets
We propose a new method for comparing learning algorithms on multiple tasks which is based on a novel non-parametric test that we call the Poisson binomial test. The key aspect of...
Alexandre Lacoste, François Laviolette, Mar...
TIP
2010
176views more  TIP 2010»
13 years 3 months ago
A PDE Formalization of Retinex Theory
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...
Jean-Michel Morel, Ana Belen Petro, Catalina Sbert
FMCAD
2000
Springer
14 years 12 days ago
Formal Verification of Floating Point Trigonometric Functions
Abstract. We have formal verified a number of algorithms for evaluating transcendental functions in double-extended precision floating point arithmetic in the Intel
John Harrison