932 search results - page 103 / 187 » Uniform Random Number Generators |
152
click to vote
SEMWEB
2007
Springer
16 years 8 days ago
2007
Springer
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...
166
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
146
click to vote
FOCS
2007
IEEE
16 years 14 days ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
179
click to vote
CISC
2007
Springer
16 years 10 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 ...
129
click to vote
ICIP
2006
IEEE
16 years 5 days ago
2006
IEEE
Compressive sampling (CS), or “Compressed Sensing,” has recently generated a tremendous amount of excitement in the image processing community. CS involves taking a relatively...