We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
— This paper proposes a new algorithm to identify and compose building blocks based on minimum mutual information criterion. Building blocks are interpreted as common subsequence...
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton
Clustering of data has numerous applications and has been studied extensively. It is very important in Bioinformatics and data mining. Though many parallel algorithms have been des...