Sciweavers

140 search results - page 8 / 28
» Practical Suffix Tree Construction
Sort
View
KDD
2008
ACM
176views Data Mining» more  KDD 2008»
14 years 8 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...
DAC
2006
ACM
14 years 9 months ago
Timing-driven Steiner trees are (practically) free
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sz...
ICDM
2009
IEEE
124views Data Mining» more  ICDM 2009»
13 years 5 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...
IPL
2010
74views more  IPL 2010»
13 years 6 months ago
The repeater tree construction problem
A tree-like substructure on a computer chip whose task it is to carry a signal from a source circuit to possibly many sink circuits and which consists only of wires and so-called ...
Christoph Bartoschek, Stephan Held, Jens Maß...
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
14 years 1 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...