686 search results - page 34 / 138 » On the General Applicability of Instruction-Set Randomizatio... |
88
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We use a generalization of the Lindeberg principle developed by Sourav Chatterjee to prove universality properties for various problems in communications, statistical learning and...
132
click to vote
TCC
2009
Springer
16 years 4 months ago
2009
Springer
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
107
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
134
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
The notion of using context information for solving highlevel vision problems has been increasingly realized in the field. However, how to learn an effective and efficient context...
113
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...