Sciweavers

932 search results - page 103 / 187
» Uniform Random Number Generators
Sort
View
SEMWEB
2007
Springer
15 years 4 months ago
Sampling and Soundness: Can We Have Both?
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...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
CVPR
2010
IEEE
15 years 3 months ago
Weakly-Supervised Hashing in Kernel Space
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...
Yadong Mu, Jialie Shen, Shuicheng Yan
FOCS
2007
IEEE
15 years 4 months ago
Lower Bounds on Signatures From Symmetric Primitives
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...
Boaz Barak, Mohammad Mahmoody-Ghidary
CISC
2007
Springer
111views Cryptology» more  CISC 2007»
15 years 4 months ago
Multivariates Polynomials for Hashing
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 ...
Jintai Ding, Bo-Yin Yang
ICIP
2006
IEEE
15 years 4 months ago
Compressive Sampling Vs. Conventional Imaging
Compressive sampling (CS), or “Compressed Sensing,” has recently generated a tremendous amount of excitement in the image processing community. CS involves taking a relatively...
Jarvis Haupt, Robert Nowak