Sciweavers

31 search results - page 3 / 7
» A Fast Algorithm for MacMahon's Partition Analysis
Sort
View
BMCBI
2004
158views more  BMCBI 2004»
13 years 7 months ago
Incremental genetic K-means algorithm and its application in gene expression data analysis
Background: In recent years, clustering algorithms have been effectively applied in molecular biology for gene expression data analysis. With the help of clustering algorithms suc...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Youping Deng, ...
GLVLSI
2003
IEEE
153views VLSI» more  GLVLSI 2003»
14 years 24 days ago
FORCE: a fast and easy-to-implement variable-ordering heuristic
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
BMCBI
2010
218views more  BMCBI 2010»
13 years 7 months ago
Fast multi-core based multimodal registration of 2D cross-sections and 3D datasets
Background: Solving bioinformatics tasks often requires extensive computational power. Recent trends in processor architecture combine multiple cores into a single chip to improve...
Michael Scharfe, Rainer Pielot, Falk Schreiber
DAC
2005
ACM
13 years 9 months ago
Partitioning-based approach to fast on-chip decap budgeting and minimization
This paper proposes a fast decoupling capacitance (decap) allocation and budgeting algorithm for both early stage decap estimation and later stage decap minimization in today’s ...
Hang Li, Zhenyu Qi, Sheldon X.-D. Tan, Lifeng Wu, ...
MTA
2006
195views more  MTA 2006»
13 years 7 months ago
An efficient and robust algorithm for 3D mesh segmentation
Abstract This paper presents an efficient and robust algorithm for 3D mesh segmentation. Segmentation is one of the main areas of 3D object modeling. Most segmentation methods deco...
Lijun Chen 0003, Nicolas D. Georganas