Related papers: The binary primes sequence for computational harde…
Most of the world's digital data is currently encoded in a sequential form, and compression methods for sequences have been studied extensively. However, there are many types of non-sequential data for which good compression techniques are…
Amplitude Amplification -- a key component of Grover's Search algorithm -- uses an iterative approach to systematically increase the probability of one or multiple target states. We present novel strategies to enhance the amplification…
Disentangling techniques are often needed to obtain the spectra of the individual components of binary or multiple systems. A thorough analysis of the shift-and-add algorithm of Marchenko, Moffat, & Eenens (1998) reveals that in many cases…
We develop the theory of cryptographic nondeterministic-secure pseudorandomness beyond the point reached by Rudich's original work (Rudich 1997), and apply it to draw new consequences in average-case complexity and proof complexity.…
Several improvements in numerical methods and gauge choice are presented that make it possible now to perform simulations of the merger and ringdown phases of "generic" binary black-hole evolutions using the pseudo-spectral evolution code…
We introduce new method for generating correlated or uncorrelated Bernoulli random variables by using the binary expansion of a continuous random variable with support on the unit interval. We show that when this variable has a symmetric…
We propose here a new model of encryption of binary data taking advantage of the complexity associated with delayed dynamics. In this scheme, the encryption process is a coupling dynamics with various time delays between different bits in…
Neural networks with binary weights are computation-efficient and hardware-friendly, but their training is challenging because it involves a discrete optimization problem. Surprisingly, ignoring the discrete nature of the problem and using…
An important functional of Poisson random measure is the negative binomial process (NBP). We use NBP to introduce a generalized Poisson-Kingman distribution and its corresponding random discrete probability measure. This random discrete…
The search for a closed-form expression of the $n$-th prime number, $p_n$, has long oscillated between the rigid determinism of analytic functions and the apparent randomness of local distributions. This paper explores three different…
Binary Hashing is widely used for effective approximate nearest neighbors search. Even though various binary hashing methods have been proposed, very few methods are feasible for extremely high-dimensional features often used in visual…
Binary embedding of high-dimensional data requires long codes to preserve the discriminative power of the input space. Traditional binary coding methods often suffer from very high computation and storage costs in such a scenario. To…
We propose a new randomized ensemble technique with a provable security guarantee against black-box transfer attacks. Our proof constructs a new security problem for random binary classifiers which is easier to empirically verify and a…
The binary signed-digit representation of integers is used for efficient computation in various settings. The Stern polynomial is a polynomial extension of the well-studied Stern diatomic sequence, and has itself has been investigated in…
The aim of this paper is to present a new design for a pseudorandom number generator (PRNG) that is cryptographically secure, passes all of the usual statistical tests referenced in the literature and hence generates high quality random…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
Ensemble learning combines multiple classifiers in the hope of obtaining better predictive performance. Empirical studies have shown that ensemble pruning, that is, choosing an appropriate subset of the available classifiers, can lead to…
Compression of integer sets and sequences has been extensively studied for settings where elements follow a uniform probability distribution. In addition, methods exist that exploit clustering of elements in order to achieve higher…
We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like…
The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack…