Sciweavers

291 search results - page 26 / 59
» Clustering and the Biclique Partition Problem
Sort
View
ICCAD
1998
IEEE
65views Hardware» more  ICCAD 1998»
15 years 5 months ago
Multiway partitioning with pairwise movement
It is known to many researchers in the partitioning community that the recursive bipartitioning approach outperforms the direct non-recursive approach in solving the multiway part...
Jason Cong, Sung Kyu Lim
BMCBI
2010
121views more  BMCBI 2010»
14 years 10 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...
CSCWD
2008
Springer
15 years 3 months ago
Task partition for function tree according to innovative functional reasoning
Task partition is a critical problem of collaborative conceptual design. Aiming at the shortage that current task partition methods don't accord to innovative functional reas...
Yiming Tang, Xiaoping Liu
UAI
2008
15 years 2 months ago
Flexible Priors for Exemplar-based Clustering
Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they ...
Daniel Tarlow, Richard S. Zemel, Brendan J. Frey
ASPDAC
1999
ACM
113views Hardware» more  ASPDAC 1999»
15 years 5 months ago
An Efficient Iterative Improvement Technique for VLSI Circuit Partitioning Using Hybrid Bucket Structures
In this paper, we present a fast and efficient Iterative Improvement Partitioning (IIP) technique for VLSI circuits and hybrid bucket structures on its implementation. Due to thei...
C. K. Eem, J. W. Chong