Related papers: Construction algorithms for plane nets in base $b$

This paper shows how to train binary networks to within a few percent points ($\sim 3-5 \%$) of the full precision counterpart. We first show how to build a strong baseline, which already achieves state-of-the-art accuracy, by combining…

We show that in a complex d-dimensional vector space, one can find O(d) bases whose elements form a 2-design. Such vector sets generalize the notion of a maximal collection of mutually unbiased bases (MUBs). MUBs have manifold applications…

In this paper we give a formula for the classes (in the Grothendieck ring of complex quasi-projective varieties) of irreducible components of $(1,k)$-quasi-homogeneous Hilbert schemes of points on the plane. We find a new simple geometric…

We study the relation between the type of a double point of a plane curve and the curvilinear 0-dimensional subschemes of the curve at the point. An Algorithm related to a classical procedure for the study of double points via osculating…

We study the connections between three seemingly different combinatorial structures - "uniform" brackets in statistics and probability theory, "containers" in online and distributed learning theory, and "combinatorial Macbeath regions", or…

We show how to obtain a fast component-by-component construction algorithm for higher order polynomial lattice rules. Such rules are useful for multivariate quadrature of high-dimensional smooth functions over the unit cube as they achieve…

The present work proposes a solution to the challenging problem of registering two partial point sets of the same object with very limited overlap. We leverage the fact that most objects found in man-made environments contain a plane of…

Existing panoramic layout estimation solutions tend to recover room boundaries from a vertically compressed sequence, yielding imprecise results as the compression process often muddles the semantics between various planes. Besides, these…

In this paper we develop a framework to study the dependence structure of scrambled $(t,m,s)$-nets. It relies on values denoted by $C_b(\mathbf{k};P_n)$, which are related to how many distinct pairs of points from $P_n$ lie in the same…

As a variant of the celebrated Szemer\'edi--Trotter theorem, Guth and Katz proved that $m$ points and $n$ lines in $\mathbb{R}^3$ with at most $\sqrt{n}$ lines in a common plane must determine at most $O(m^{1/2}n^{3/4})$ incidences for…

Quasi-Monte Carlo (QMC) sampling has been developed for integration over $[0,1]^s$ where it has superior accuracy to Monte Carlo (MC) for integrands of bounded variation. Scrambled net quadrature gives allows replication based error…

Low-discrepancy points (also called Quasi-Monte Carlo points) are deterministically and cleverly chosen point sets in the unit cube, which provide an approximation of the uniform distribution. We explore two methods based on such…

In this paper problem of construction of optimal quadrature formulas in $W_2^{(m,m-1)}(0,1)$ space is considered. Here by using Sobolev's algorithm when $m=1,2$ we find the optimal coefficients of the quadrature formulas of the form $$…

We formulate in this paper the mini-bucket algorithm for approximate inference in terms of exact inference on an approximate model produced by splitting nodes in a Bayesian network. The new formulation leads to a number of theoretical and…

Here we describe the distribution of rational points on the Hilbert scheme of two points in the projective plane. More specifically, we explicitly describe a two-parameter family of height functions $H_{s, t}$, such that the height function…

Singularities of plane into plane mappings described by parabolic two-component systems of quasi-liner partial differential equations of the first order are studied. Impediments arising in the application of the original Whitney's approach…

In this note, we study a concatenation of quasi-Monte Carlo and plain Monte Carlo rules for high-dimensional numerical integration in weighted function spaces. In particular, we consider approximating the integral of periodic functions…

The explicite formulas for m\"{o}biusien function and some other important elements of the incidence algebra are delivered. For that to do one uses kwa\'sniewski's construction of his fibonacci cobweb poset in the plane grid coordinate…

We develop a monotone, two-scale discretization for a class of integrodifferential operators of order $2s$, $s \in (0,1)$. We apply it to develop numerical schemes, and derive pointwise convergence rates, for linear and obstacle problems…

Random networks are intensively used as null models to investigate properties of complex networks. We describe an efficient and accurate algorithm to generate arbitrarily two-point correlated undirected random networks without self- or…