4451 search results - page 248 / 891 » On Random Ordering Constraints |
179
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
174
click to vote
ICDE
2006
IEEE
16 years 20 days ago
2006
IEEE
Several randomized techniques have been proposed for privacy preserving data mining of continuous data. These approaches generally attempt to hide the sensitive data by randomly m...
183
click to vote
ASIACRYPT
2000
Springer
15 years 11 months ago
2000
Springer
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
169
click to vote
IPL
2008
15 years 6 months ago
2008
In order to generate a universal probability distribution to extrapolate a binary string x of length i, we feed random bits into a universal device, M. When we find an input strin...
166
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...