Abstract--We propose several algorithms for topology aggregation (TA) to effectively summarize large-scale networks. These TA techniques are shown to significantly better for path ...
This paper proposes a guaranteed robust bounded-error distributed estimation algorithm. It may be employed to perform parameter estimation from data collected in a network of wire...
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to yield the desired theoretical guarantees are often neither simple nor practical. Here ...
We describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of finite groups...