Sciweavers

903 search results - page 34 / 181
» Non-well-founded trees in categories
Sort
View
CSB
2004
IEEE
173views Bioinformatics» more  CSB 2004»
15 years 3 months ago
Gene Ontology Friendly Biclustering of Expression Profiles
The soundness of clustering in the analysis of gene expression profiles and gene function prediction is based on the hypothesis that genes with similar expression profiles may imp...
Jinze Liu, Wei Wang 0010, Jiong Yang
DAC
2008
ACM
16 years 23 days ago
Type-matching clock tree for zero skew clock gating
Clock skew minimization is always very important in the clock tree synthesis. Due to clock gating, the clock tree may include different types of logic gates, e.g., AND gates, OR g...
Chia-Ming Chang, Shih-Hsu Huang, Yuan-Kai Ho, Jia-...
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
16 years 5 days ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
WWW
2007
ACM
16 years 13 days ago
A new suffix tree similarity measure for document clustering
In this paper, we propose a new similarity measure to compute the pairwise similarity of text-based documents based on suffix tree document model. By applying the new suffix tree ...
Hung Chim, Xiaotie Deng
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
16 years 5 days ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer