1089 search results - page 19 / 218 » Randomness and Reducibility |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all th...
ICCCN
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—CAN is a well-known DHT technique for contentbased P2P networks, where each node is assigned a zone in a virtual coordinate space to store the index of the data hashed i...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
100
click to vote
ICDM
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
107
click to vote
CHES
2009
Springer
16 years 9 days ago
2009
Springer
We have devised a frequency injection attack which is able to destroy the source of entropy in ring-oscillator-based true random number generators (TRNGs). A TRNG will lock to freq...