Sciweavers

53 search results - page 3 / 11
» Practical methods for constructing suffix trees
Sort
View
CIKM
2005
Springer
14 years 19 days ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
ACL
1998
13 years 8 months ago
Using Decision Trees to Construct a Practical Parser
This paper describes novel and practical Japanese parsers that uses decision trees. First, we construct a single decision tree to estimate modification probabilities; how one phra...
Masahiko Haruno, Satoshi Shirai, Yoshifumi Ooyama
ISPD
2000
ACM
126views Hardware» more  ISPD 2000»
13 years 11 months ago
A practical clock tree synthesis for semi-synchronous circuits
In this paper, we propose a new clock tree synthesis method for semi-synchronous circuits. A clock tree obtained by the proposed method is a multi-level multi-way clock tree such ...
Masahiko Toyonaga, Keiichi Kurokawa, Takuya Yasui,...
KDD
2008
ACM
176views Data Mining» more  KDD 2008»
14 years 7 months ago
Context-aware query suggestion by mining click-through and session data
Query suggestion plays an important role in improving the usability of search engines. Although some recently proposed methods can make meaningful query suggestions by mining quer...
Huanhuan Cao, Daxin Jiang, Jian Pei, Qi He, Zhen L...
ICDM
2009
IEEE
124views Data Mining» more  ICDM 2009»
13 years 4 months ago
A Practical Differentially Private Random Decision Tree Classifier
In this paper, we study the problem of constructing private classifiers using decision trees, within the framework of differential privacy. We first construct privacy-preserving ID...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...