400 search results - page 49 / 80 » Lower Bounds Using Kolmogorov Complexity |
TIT
1998
13 years 8 months ago
1998
—A sequential decoder for linear block codes that performs maximum-likelihood soft-decision decoding is described. The decoder uses a metric computed from a lower bound on the co...
SWAT
2004
Springer
14 years 2 months ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
LFCS
2007
Springer
14 years 2 months ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
COMCOM
2004
13 years 8 months ago
2004
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...