We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
In this paper, a symbolic dynamical model of the average queue size of the random early detection (RED) algorithm is proposed. The conditions on both the system parameters and the...
Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling, Herber...