10182 search results - page 1717 / 2037 » Case Studies |
175
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible w...
198
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
173
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Today, people use multiple devices to fulfill their information needs. However, designers design each device individually, without accounting for the other devices that users may ...
144
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The Minimum Description Length principle for online sequence estimation/prediction in a proper learning setup is studied. If the underlying model class is discrete, then the total...
143
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
How to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decod...