1132 search results - page 41 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
TIT
2008
14 years 11 months ago
2008
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
RANDOM
1998
Springer
15 years 4 months ago
1998
Springer
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
ARSCOM
2008
14 years 12 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
KDID
2004
15 years 1 months ago
2004
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
AAECC
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...