Sciweavers

103 search results - page 2 / 21
» Hierarchical Design of Fast Minimum Disagreement Algorithms
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 6 months ago
Fast Self-Stabilizing Minimum Spanning Tree Construction
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...
Lélia Blin, Shlomi Dolev, Maria Potop-Butuc...
CEC
2009
IEEE
13 years 11 months ago
Direct and explicit building blocks identification and composition algorithm
— 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...
Chalermsub Sangkavichitr, Prabhas Chongstitvatana
ICCV
1999
IEEE
14 years 9 months ago
Fast Approximate Energy Minimization via Graph Cuts
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...
Yuri Boykov, Olga Veksler, Ramin Zabih
FMCAD
2007
Springer
14 years 1 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
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
HPCC
2007
Springer
14 years 1 months ago
An Adaptive Parallel Hierarchical Clustering Algorithm
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...
Zhaopeng Li, Kenli Li, Degui Xiao, Lei Yang