Related papers: Strong approximation for the intersection of two q…
With reference to a baseline parametrization, we explore highly efficient fractional factorial designs for inference on the main effects and, perhaps, some interactions. Our tools include approximate theory together with certain carefully…
We consider the problem of approximating a truncated Gaussian kernel using Fourier (trigonometric) functions. The computation-intensive bilateral filter can be expressed using fast convolutions by applying such an approximation to its range…
Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…
We study the geometry of elliptic fibrations satisfying the conditions of Step 2 of Tate's algorithm with a discriminant of valuation 4. We call such geometries USp(4)-models, as the dual graph of their special fiber is the twisted affine…
The von Neumann-Halperin method of alternating projections converges strongly to the projection of a given point onto the intersection of finitely many closed affine subspaces. We propose acceleration schemes making use of two ideas:…
It is well known that approximation of functions on $[0,1]$ whose periodic extension is not continuous fail to converge uniformly due to rapid Gibbs oscillations near the boundary. Among several approaches that have been proposed toward the…
We discuss the computational complexity of approximating maximum a posteriori inference in sum-product networks. We first show NP-hardness in trees of height two by a reduction from maximum independent set; this implies non-approximability…
Conditional Random Fields (CRF) have been widely used in a variety of computer vision tasks. Conventional CRFs typically define edges on neighboring image pixels, resulting in a sparse graph such that efficient inference can be performed.…
Guo and Xu determined the maximum size of intersecting families over finite affine spaces and showed that any family reaches maximum size must be trivial. In this paper, we characterize non-trivial intersecting family with maximum size.
An effective means to approximate an analytic, nonperiodic function on a bounded interval is by using a Fourier series on a larger domain. When constructed appropriately, this so-called Fourier extension is known to converge geometrically…
We prove an intersection formula for two plane branches in terms of their semigroups and key polynomials. Then we provide a strong version of Bayer's theorem on the set of intersection numbers of two branches and apply it to the logarithmic…
The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…
In order to accelerate the Douglas--Rachford method we recently developed the circumcentered--reflection method, which provides the closest iterate to the solution among all points relying on successive reflections, for the best…
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…
t is a known fact that near field diffraction or Fresnel diffraction calculations are difficult to perform exactly. It is in general necessary to make some approximations in order to obtain a more suitable form. In this work, a numerical…
For smooth open toric varieties, we establish strong approximation off infinity with Brauer-Manin obstruction.
We obtain sharp estimates on the connectivity of complex affine hypersurfaces in terms of the decomposition of the defining equation as a sum of weighted homogeneous components relative to some weight system.
The derivative expansion approach to the calculation of the interaction between two surfaces, is a generalization of the proximity force approximation, a technique of widespread use in different areas of physics. The derivative expansion…
For rational points on algebraic varieties defined over a number field $K$, we study the behavior of the property of weak approximation with Brauer-Manin obstruction under extension of the ground field. We construct K-varieties accompanied…
This work is devoted to establish the strong convergence results of an iterative algorithm generated by the shrinking projection method in Hilbert spaces. The proposed approximation sequence is used to find a common element in the set of…