389 search results - page 24 / 78 » Computational Alternatives to Random Number Generators |
108
click to vote
VLSID
2002
IEEE
16 years 7 days ago
2002
IEEE
Directed test program-based verification or formal verification methods are usually quite ineffective on large cachecoherent, non-uniform memory access (CC-NUMA) multiprocessors b...
CVPR
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we present a generative model based approach to solve the multi-view stereo problem. The input images are considered to be generated by either one of two processes:...
125
click to vote
IACR
2011
13 years 11 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
121
click to vote
MOBIHOC
2007
ACM
15 years 11 months ago
2007
ACM
A prerequisite for secure communications between two sensor nodes is that these nodes exclusively share a pairwise key. Although numerous pairwise key establishment (PKE) schemes ...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...