Related papers: Binary Proportional Pairing Functions
A loss function measures the discrepancy between the true values (observations) and their estimated fits, for a given instance of data. A loss function is said to be proper (unbiased, Fisher consistent) if the fits are defined over a unit…
We define a new basis of quasisymmetric functions, the row-strict dual immaculate functions, as the generating function of a particular set of tableaux. We establish that this definition gives a function that can also be obtained by…
It is well known that if a function from set A to set B has a right inverse then the function is a surjection and the right inverse is an injection. For finite sets, the number of functions, injections, and surjections can also be counted.…
Thinning is the removal of contour pixels/points of connected components in an image to produce their skeleton with retained connectivity and structural properties. The output requirements of a thinning procedure often vary with…
We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…
Two arrays form a periodic complementary pair if the sum of their periodic autocorrelations is a delta function. Finding such pairs, however, is challenging for large arrays whose entries are constrained to a small alphabet. One such…
Given an element in a finite-dimensional real vector space, $V$, that is a nonnegative linear combination of basis vectors for some basis $B$, we compute the probability that it is furthermore a nonnegative linear combination of basis…
Some techniques for the use of bitwise operations are described in the article. As an example, an open problem of isomorphism-free generations of combinatorial objects is discussed. An equivalence relation on the set of square binary…
The likelihood function represents statistical evidence in the context of data and a probability model. Considerable theory has demonstrated that evidence strength for different parameter values can be interpreted from the ratio of…
A set of probabilistic predictions is well calibrated if the events that are predicted to occur with probability p do in fact occur about p fraction of the time. Well calibrated predictions are particularly important when machine learning…
A function on a (generally infinite) graph $\G$ with values in a field $K$ of characteristic 2 will be called {\it harmonic} if its value at every vertex of $\G$ is the sum of its values over all adjacent vertices. We consider binary…
Boolean functions with good cryptographic criteria when restricted to the set of vectors with constant Hamming weight play an important role in the recent FLIP stream cipher. In this paper, we propose a large class of weightwise perfectly…
In this article I study pairing of two interacting particles in ideal 1D, 2D and Bethe lattices. I employ the method of recursion that has been formulated recently by Berciu et. al. to compute the pair functions in real space without…
One way to find closest pairs in large datasets is to use hash functions. In recent years locality-sensitive hash functions for various metrics have been given: projecting an n-cube onto k bits is simple hash function that performs well. In…
Predictions are often probabilities; e.g., a prediction could be for precipitation tomorrow, but with only a 30% chance. Given such probabilistic predictions together with the actual outcomes, "reliability diagrams" help detect and diagnose…
In binary jumbled pattern matching we wish to preprocess a binary string $S$ in order to answer queries $(i,j)$ which ask for a substring of $S$ that is of size $i$ and has exactly $j$ 1-bits. The problem naturally generalizes to…
We use a classical characterisation to prove that functions which are bounded away from zero cannot be elements of reproducing kernel Hilbert spaces whose reproducing kernels decays to zero in a suitable way. The result is used to study…
Bilinear models has been shown to achieve impressive performance on a wide range of visual tasks, such as semantic segmentation, fine grained recognition and face recognition. However, bilinear features are high dimensional, typically on…
The purpose of this paper is to present a collection of interesting generating functions for partitions which have connections to positive definite binary quadratic forms. In establishing our results we obtain some new Bailey pairs.
We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…