10054 search results - page 248 / 2011 » On the Complexity of Function Learning |
113
click to vote
ISORC
2008
IEEE
15 years 9 months ago
2008
IEEE
The specific constraints that must be satisfied by embedded systems, such as timeliness, energy efficiency of battery-operated devices, dependable operation in safety-relevant sce...
115
click to vote
CIE
2007
Springer
15 years 9 months ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The issue of multiuser cooperation in a complexity constrained noise-free CDMA channel is addressed. Multiuser cooperation is imperative if conventional demodulation is expected to...
161
click to vote
LICS
2012
IEEE
13 years 5 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...