3177 search results - page 2 / 636 » Can We Have Confidence in a Tree Representation |
ICSE
2009
IEEE-ACM
14 years 6 months ago
2009
IEEE-ACM
Much of what we know about how programmers refactor in the wild is based on studies that examine just a few software projects. Researchers have rarely taken the time to replicate ...
TSP
2008
13 years 5 months ago
2008
We consider the problem of recovering a matrix from its action on a known vector in the setting where the matrix can be represented efficiently in a known matrix dictionary. Conne...
TR
2008
13 years 5 months ago
2008
The failure probability of a product F(t) and the life time quantile tp are commonly used metrics in reliability applications. Confidence intervals are used to quantify the statis...
COLT
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...
CP
2009
Springer
14 years 5 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...