4622 search results - page 100 / 925 » Foundations of Information Theory |
194
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
148
click to vote
KR
2004
Springer
15 years 12 months ago
2004
Springer
This paper offers two main contributions. On the one hand, it establishes a general formal framework for developing a foundational ontology of socially constructed entities, in th...
144
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
This paper is a contribution to the study of uniformity conditions for endofunctors on sets initiated in Aczel [1] and pursued later in other works such as Turi [17]. The main res...
172
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
138
click to vote
JGT
2010
15 years 5 months ago
2010
: A k-fold coloring of a graph is a function that assigns to each vertex a set of k colors, so that the color sets assigned to adjacent Contract grant sponsor: NSFC; Contract grant...