4377 search results - page 255 / 876 » Mass problems and randomness |
158
click to vote
PCM
2001
Springer
15 years 11 months ago
2001
Springer
In a digital multimedia era, the security of multimedia over network transmission becomes a challenging issue. A strategy, combining cryptography with steganography, is investigat...
155
click to vote
IJCAI
2001
15 years 8 months ago
2001
We show that nodes of high degree tend to occur infrequently in random graphs but frequently in a wide variety of graphs associated with real world search problems. We then study ...
148
click to vote
SIGPRO
2002
15 years 6 months ago
2002
In blind source separation (BSS), two di erent separation techniques are mainly used: minimal mutual information (MMI), where minimization of the mutual output information yields ...
179
click to vote
EUROCRYPT
2008
Springer
15 years 8 months ago
2008
Springer
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
187
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...