We give cell-probe bounds for the computation of edit distance, Hamming distance, convolution and longest common subsequence in a stream. In this model, a fixed string of n symbols is given and one δ-bit symbol arrives at a time in a stream. After each symbol arrives, the distance between the fixed string and a suffix of most recent symbols of the stream is reported. The cell-probe model is per...

When implementing a digital filter, it is important to utilize in the design a bound or estimate of the largest output value which will be obtained. Such a bound is particularly useful when fixed point arithmetic is to be used since it assists in determining register lengths necessary to prevent overflow. In this paper we consider the class of digital filters which have an impulse response of f...

The field generated by scattering of light from a quasi-homogeneous source on a quasi-homogeneous, random medium is investigated. It is found that, within the accuracy of the first-order Born approximation, the far field satisfies two reciprocity relations (sometimes called uncertainty relations). One of them implies that the spectral density (or spectral intensity) is proportional to the convo...

The primary motivation of the paper is to define a new class C h δ α , β γ which consists univalent functions associated with Chebyshev polynomials. For this class, we determine coeff...

The k-diameter of a graph 0 is the largest pairwise minimum distance of a set of k vertices in 0, i.e., the best possible distance of a code of size k in 0. A k-diameter for some k is called a multidiameter of the graph. We study the function N (k,1, D), the largest size of a graph of degree at most1 and kdiameter D. The graphical analogues of the Gilbert bound and the Hamming bound in coding t...

Separable sublinear functions are used to provide upper bounds on the recourse function of a stochastic program. The resulting problem's objective involves the inf-convolution of convex functions. A dual of this problem is formulated to obtain an implementable procedure to calculate the bound. Function evaluations for the resulting convex program only require a small number of single integratio...

We prove three results concerning convolution operators and lacunary maximal functions associated to dilates of measures. First we obtain an H to L bound for lacunary maximal operators under a dimensional assumption on the underlying measure and an assumption on an Lp regularity bound for some p > 1. Secondly, we obtain a necessary and sufficient condition for L boundedness of lacunary maximal ...

We present a Minkowski sum algorithm for polyhedra based on convolution. We develop robust CPU and GPU implementations, using our ACP robustness technique to enforce a user-specified backward error bound. We test the programs on 45 inputs with an error bound of 10−8. The CPU program outperforms prior work, including non-robust programs. The GPU program exhibits a median speedup factor of 36, wh...