1222 search results - page 97 / 245 » corr 2008 |
138
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
141
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A new perspective on cognitive radio is presented for the case where the primary transmission is in uncoded analog form. The basic idea is to exploit signal-to-noise ratio margins ...
134
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
164
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
169
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we evaluate available steganographic techniques for SIP (Session Initiation Protocol) that can be used for creating covert channels during signaling phase of VoIP (V...