Sciweavers

336 search results - page 6 / 68
» Analytic Cut Trees
Sort
View
JCNS
2008
59views more  JCNS 2008»
13 years 7 months ago
Democratization in a passive dendritic tree: an analytical investigation
Yulia Timofeeva, S. J. Cox, Stephen Coombes, Kresi...
SIGCOMM
2010
ACM
13 years 7 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...
HPCC
2007
Springer
14 years 1 months ago
Quantification of Cut Sequence Set for Fault Tree Analysis
A new evaluation method is presented that employs cut sequence set (CSS) to analyze fault trees. A cut sequence is a set of basic events that fail in a specific order that can indu...
Dong Liu, Chunyuan Zhang, Weiyan Xing, Rui Li, Hai...
WWW
2008
ACM
14 years 8 months ago
Recommending questions using the mdl-based tree cut model
The paper is concerned with the problem of question recommendation. Specifically, given a question as query, we are to retrieve and rank other questions according to their likelih...
Yunbo Cao, Huizhong Duan, Chin-Yew Lin, Yong Yu, H...
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...