Related papers: Binomial collisions and near collisions
The purpose of this paper is concerned with the approximate solution of split equality problems. We introduce two types of algorithms and a new self-adaptive stepsize without prior knowledge of operator norms. The corresponding strong…
Sequence classification algorithms, such as SVM, require a definition of distance (similarity) measure between two sequences. A commonly used notion of similarity is the number of matches between $k$-mers ($k$-length subsequences) in the…
We investigate the question if quantum algorithms exist that compute the maximum of a set of conjugated elements of a given number field in quantum polynomial time. We will relate the existence of these algorithms for a certain family of…
When the competing classes in a classification problem are not of comparable size, many popular classifiers exhibit a bias towards larger classes, and the nearest neighbor classifier is no exception. To take care of this problem, we develop…
The search for higher-order feature interactions that are statistically significantly associated with a class variable is of high relevance in fields such as Genetics or Healthcare, but the combinatorial explosion of the candidate space…
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
We give some results and conjectures about recurrence relations for certain sequences of binomial sums.
The odds theorem and the corresponding solution algorithm (odds algorithm) are tools to solve a wide range of optimal stopping problems. Its generality and tractability have caught much attention. (Google for instance "Bruss odds" to obtain…
A linear time algorithm to find a set of nearest elements in a mesh.
Probably we have observed a new simple phenomena dealing with approximations to two real numbers.
We develop general methods to obtain fast (polynomial time) estimates of the cardinality of a combinatorially defined set via solving some randomly generated optimization problems on the set. Geometrically, we estimate the cardinality of a…
Correspondence selection aiming at seeking correct feature correspondences from raw feature matches is pivotal for a number of feature-matching-based tasks. Various 2D (image) correspondence selection algorithms have been presented with…
We present a novel approach to the age-old question of whether perfect cuboids exist. Our approach consists of two new computer search algorithms, arising from the analysis of "perfect plinths" reported by one of us recently, that are much…
We present a systematic approach for achieving fairness in a binary classification setting. While we focus on two well-known quantitative definitions of fairness, our approach encompasses many other previously studied definitions as special…
In this article, we consider a collection of geometric problems involving points colored by two colors (red and blue), referred to as bichromatic problems. The motivation behind studying these problems is two fold; (i) these problems appear…
An efficient numerical algorithm for the computation of linking number is presented. The algorithm keep tracks or rounding error so that it can ensure the correctness of the results.
We derive formulas which connect cumulants of particle numbers observed with efficiency losses with the original ones based on the binomial model. These formulas can describe the case with multiple efficiencies in a compact form. Compared…
Composite likelihood provides approximate inference when the full likelihood is intractable and sub-likelihood functions of marginal events can be evaluated relatively easily. It has been successfully applied for many complex models.…
We investigate some aspects of bounding, splitting, and almost disjointness. In particular, we investigate the relationship between the bounding number, the closed almost disjointness number, splitting number, and the existence of certain…
A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…