Sciweavers

371 search results - page 54 / 75
» Partition Theorems and Computability Theory
Sort
View
61
Voted
MLG
2007
Springer
15 years 3 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
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
15 years 4 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton
STACS
1993
Springer
15 years 1 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
DCC
2007
IEEE
15 years 9 months ago
Lossless Transmission of Correlated Sources over a Multiple Access Channel with Side Information
In this paper, we consider lossless transmission of arbitrarily correlated sources over a multiple access channel. Characterization of the achievable rates in the most general set...
Deniz Gündüz, Elza Erkip
ICTAC
2009
Springer
15 years 4 months ago
Input-Output Model Programs
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...
Margus Veanes, Nikolaj Bjørner