Sciweavers

9166 search results - page 1514 / 1834
» A framework for comparing models of computation
Sort
View
WWW
2007
ACM
16 years 7 months 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
WWW
2006
ACM
16 years 7 months ago
Template guided association rule mining from XML documents
Compared with traditional association rule mining in the structured world (e.g. Relational Databases), mining from XML data is confronted with more challenges due to the inherent ...
Rahman Ali Mohammadzadeh, Sadegh Soltan, Masoud Ra...
180
Voted
KDD
2002
ACM
118views Data Mining» more  KDD 2002»
16 years 7 months ago
SECRET: a scalable linear regression tree algorithm
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...
Alin Dobra, Johannes Gehrke
VLSID
2003
IEEE
167views VLSI» more  VLSID 2003»
16 years 7 months ago
Timing Minimization by Statistical Timing hMetis-based Partitioning
In this paper we present statistical timing driven hMetisbased partitioning. We approach timing driven partitioning from a different perspective: we use the statistical timing cri...
Cristinel Ababei, Kia Bazargan
VLSID
2001
IEEE
129views VLSI» more  VLSID 2001»
16 years 7 months ago
Design Of Provably Correct Storage Arrays
In this paper we describe a hardware design method for memory and register arrays that allows the application of formal equivalence checking for comparing a high-level register tr...
Rajiv V. Joshi, Wei Hwang, Andreas Kuehlmann
« Prev « First page 1514 / 1834 Last » Next »