2996 search results - page 181 / 600 » Numberings and Randomness |
181
click to vote
ALT
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
160
Voted
SOCC
2008
IEEE
16 years 28 days ago
2008
IEEE
— A methodology is proposed to reduce power/ground and substrate coupling noise by randomizing the clock signal. A pseudo-random number generation algorithm is used to produce a ...
169
Voted
ICMCS
2008
IEEE
16 years 1 months ago
2008
IEEE
As an important attribute directly influencing the steganographic scheme, the embedding efficiency is defined as the average number of random data bits per one embedding change...
189
Voted
CISC
2007
Springer
16 years 22 days ago
2007
Springer
We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security ...
170
Voted
CSFW
2002
IEEE
15 years 11 months ago
2002
IEEE
We present a formal analysis technique for probabilistic security properties of peer-to-peer communication systems based on random message routing among members. The behavior of g...