314 search results - page 41 / 63 » A Comparison of Known Codes, Random Codes, and the Best Code... |
WCNC
2010
IEEE
13 years 11 months ago
2010
IEEE
— In this paper, we consider the transmission of a Gaussian source in a multi-relay cooperative network, where limited channel state feedback is combined with separate source and...
SODA
1997
ACM
13 years 8 months ago
1997
ACM
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
DCC
2011
IEEE
13 years 2 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
IJSN
2007
13 years 7 months ago
2007
: Most Internet worms use random scanning. The distribution of vulnerable hosts on the Internet, however, is highly non-uniform over the IP-address space. This implies that random ...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...