Count-Sketch [6] and Count-Median [11] are two widely used sketching algorithms for processing large-scale distributed and streaming datasets, such as finding frequent elements, computing frequency moments, performing point queries, etc. The errors of Count-Sketch and Count-Median are expressed in terms of the sum of coordinates of the input vector excluding those largest ones, or, the mass on ...

In this paper we investigate the relationship between inequality and the environment in a growing economy from a political economy perspective. We consider an endogenous growth economy, where growth generates pollution and a deterioration of the environment. Public expenditures may either be devoted to supporting growth or abating pollution. The decision over the public programs is done in a di...

Aktmcz-We present a fast algorithm for two-dimensional median fiitering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a window size of m X n, the computer time required is O(n).

For noninformative nonparametric estimation of finite population quantiles under simple random sampling, estimation based on the Polya posterior is similar to estimation based on the Bayesian approach developed by Ericson (1969, JRSSB, 31, 195-233) in that the Polya posterior distribution is the limit of Ericson’s posterior distributions as the weight placed on the prior distribution diminishes...

SUMMARY Consider the problem of estimating the population mean when it is known a priori that the population median belongs to some interval. More generally consider the problem of estimating the population mean when it is known a priori that the median of some auxiliary variable belongs to some interval. In this note we show how the Polya posterior, which is useful in problems where little pri...

Recursive spectral bisection (RSB) is a heuristic technique for finding a minimum cut graph bisection. To use this method the second eigenvector of the Laplacian of the graph is computed and from it a bisection is obtained. The most common method is to use the median of the components of the second eigenvector to induce a bisection. We prove here that this median cut method is optimal in the se...

We consider classes of graphs that enjoy the following properties: they are closed for gated subgraphs, gated amalgamation and Cartesian products, and for any gated subgraph the inverse of the gate function maps vertices to gated subsets. We prove that any graph of such a class contains a peripheral subgraph which is a Cartesian product of two graphs: a gated subgraph of the graph and a prime g...

We consider the problem of supporting several different path queries over a tree on n nodes, each having a weight drawn from a set of σ distinct values, where σ ≤ n. One query we support is the path median query, which asks for the median weight on a path between two given nodes. For this and the more general path selection query, we present a linear space data structure that answers queries in...