118 search results - page 11 / 24 » Permutation codes |
WAW
2009
Springer
15 years 4 months ago
2009
Springer
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
117
click to vote
SPAA
1993
ACM
15 years 1 months ago
1993
ACM
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
VLSISP
2008
14 years 9 months ago
2008
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the syst...