Related papers: Collision-resistant hash-shuffles on the reals
We present a one dimensional model for the development of corrugations in roads subjected to compressive forces from a flux of cars. The cars are modeled as damped harmonic oscillators translating with constant horizontal velocity across…
We calculate the `one-point function', meaning the marginal probability density function for any single eigenvalue, of real and complex Wishart correlation matrices. No explicit expression had been obtained for the real case so far. We…
For an integer $p\geq 2$ we construct vertical and horizontal one-pth Riordan arrays from a Riordan array. When $p=2$, one-pth Riordan arrays reduced to well known half Riordan arrays. The generating functions of the $A$-sequences of…
Algorithms of control of differential equations solutions are under investigation in the article. Idealized and real modifications of the algorithms are distinguished. An equation, which can be the base equation for investigation of the…
We use combinatorial and Fourier analytic arguments to prove various non-existence results on systems of real and complex unbiased Hadamard matrices. In particular, we prove that a complete system of complex mutually unbiased Hadamard…
We establish strong duality relations for functional two-step compositional risk-constrained learning problems with multiple nonconvex loss functions and/or learning constraints, regardless of nonconvexity and under a minimal set of…
We show that the deviation between the slopes of two convex functions controls the deviation between the functions themselves. This result reveals that the slope -- a one dimensional construct -- robustly determines convex functions, up to…
We prove that the equivalence of two fundamental problems in the theory of computing. For every polynomial $t(n)\geq (1+\varepsilon)n, \varepsilon>0$, the following are equivalent: - One-way functions exists (which in turn is equivalent to…
Given a specified average load factor, hash tables offer the appeal of constant time lookup operations. However, hash tables could face severe hash collisions because of malicious attacks, buggy applications, or even bursts of incoming…
For a one-dimensional random walk in random scenery (RWRS) on Z, we determine its quenched weak limits by applying Strassen's functional law of the iterated logarithm. As a consequence, conditioned on the random scenery, the one-dimensional…
This paper presents converse theorems for safety in terms of barrier functions for unconstrained continuous-time systems modeled as differential inclusions. Via a counterexample, we show the lack of existence of autonomous and continuous…
We present a powerful new loss function and training scheme for learning binary hash functions. In particular, we demonstrate our method by creating for the first time a neural network that outperforms state-of-the-art Haar wavelets and…
We base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…
Many applications require comparing multimodal data with different structure and dimensionality that cannot be compared directly. Recently, there has been increasing interest in methods for learning and efficiently representing such…
Alignment algorithms usually rely on simplified models of gaps for computational efficiency. Based on an isomorphism between alignments and physical helix-coil models, we show in statistical mechanics that alignments with realistic laws for…
A minimal perfect hash function (MPHF) bijectively maps a set S of objects to the first |S| integers. It can be used as a building block in databases and data compression. RecSplit [Esposito et al., ALENEX'20] is currently the most space…
We describe an obstruction to smoothing stable maps in smooth projective varieties, which generalizes some previously known obstructions. Our obstruction comes from the non-existence of certain rational functions on the ghost components,…
Highway merges present difficulties for human drivers and automated vehicles due to incomplete situational awareness and a need for a structured (precedence, order) environment, respectively. In this paper, an unstructured merge algorithm…
We propose a new fast word embedding technique using hash functions. The method is a derandomization of a new type of random projections: By disregarding the classic constraint used in designing random projections (i.e., preserving pairwise…
The assessment of highly-risky situations at road intersections have been recently revealed as an important research topic within the context of the automotive industry. In this paper we shall introduce a novel approach to compute risk…