Sciweavers

1060 search results - page 74 / 212
» On the Discovery of Random Trees
Sort
View
80
Voted
DAM
2007
74views more  DAM 2007»
14 years 10 months ago
On the uniform edge-partition of a tree
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao ...
143
Voted
ECAI
2008
Springer
14 years 12 months ago
MTForest: Ensemble Decision Trees based on Multi-Task Learning
Many ensemble methods, such as Bagging, Boosting, Random Forest, etc, have been proposed and widely used in real world applications. Some of them are better than others on noisefre...
Qing Wang, Liang Zhang, Mingmin Chi, Jiankui Guo
PVLDB
2010
150views more  PVLDB 2010»
14 years 8 months ago
Tree Indexing on Solid State Drives
Large flash disks, or solid state drives (SSDs), have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption a...
Yinan Li, Bingsheng He, Jun Yang 0001, Qiong Luo, ...
ICDE
2009
IEEE
152views Database» more  ICDE 2009»
15 years 12 months ago
Tree Indexing on Flash Disks
Abstract-- Large flash disks have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption and other features. How...
Yinan Li, Bingsheng He, Qiong Luo, Ke Yi
CCR
2004
89views more  CCR 2004»
14 years 10 months ago
Should we build Gnutella on a structured overlay?
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
Miguel Castro, Manuel Costa, Antony I. T. Rowstron