Sciweavers

478 search results - page 42 / 96
» Monads of Regular Theories
Sort
View
IPL
2007
105views more  IPL 2007»
14 years 11 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
MLG
2007
Springer
15 years 5 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
BMCBI
2005
131views more  BMCBI 2005»
14 years 11 months ago
Regularized Least Squares Cancer Classifiers from DNA microarray data
Background: The advent of the technology of DNA microarrays constitutes an epochal change in the classification and discovery of different types of cancer because the information ...
Nicola Ancona, Rosalia Maglietta, Annarita D'Addab...
82
Voted
APAL
2006
73views more  APAL 2006»
14 years 11 months ago
On the parallel between the suplattice and preframe approaches to locale theory
This paper uses the locale theory approach to topology. Two descriptions are given of all locale limits, the first description using suplattice constructions and the second prefra...
Christopher F. Townsend
ICLP
1995
Springer
15 years 2 months ago
A Method for Implementing Equational Theories as Logic Programs
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
Mantis H. M. Cheng, Douglas Stott Parker Jr., Maar...