We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we show that with a small number M of random projections of sample points in RN belo...
Chinmay Hegde, Michael B. Wakin, Richard G. Barani...
We study the asymptotic behaviour of the number Nk,n of nodes of given degree k in unlabeled random trees, when the tree size n and the node degree k both tend to infinity. It is s...
We prove that the variance of the number of different letters in random words of length n, with letters i and probabilities 2-i attached to them, is 1 + o(1). Likewise, the varian...
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...