Sciweavers

2252 search results - page 39 / 451
» Improving Random Forests
Sort
View
AAIM
2008
Springer
116views Algorithms» more  AAIM 2008»
14 years 2 months ago
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...
Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang
ICPP
1998
IEEE
14 years 6 days ago
Improving Parallel-Disk Buffer Management using Randomized Writeback
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
Mahesh Kallahalla, Peter J. Varman
APPML
2006
131views more  APPML 2006»
13 years 8 months ago
Improvement in estimating the population mean in simple random sampling
This paper proposes some estimators for the population mean using the ratio estimators presented in [C. Kadilar, H. Cingi, Ratio estimators in simple random sampling, Applied Math...
Cem Kadilar, Hulya Cingi
TCS
1998
13 years 7 months ago
An Improved Zero-One Law for Algorithmically Random Sequences
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
Steven M. Kautz
ACL
2006
13 years 9 months ago
Semi-Supervised Conditional Random Fields for Improved Sequence Segmentation and Labeling
We present a new semi-supervised training procedure for conditional random fields (CRFs) that can be used to train sequence segmentors and labelers from a combination of labeled a...
Feng Jiao, Shaojun Wang, Chi-Hoon Lee, Russell Gre...