Sciweavers

13414 search results - page 2203 / 2683
» The distributed boosting algorithm
Sort
View
ICML
2006
IEEE
16 years 8 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
ICML
2005
IEEE
16 years 8 months ago
A new Mallows distance based metric for comparing clusterings
Despite of the large number of algorithms developed for clustering, the study on comparing clustering results is limited. In this paper, we propose a measure for comparing cluster...
Ding Zhou, Jia Li, Hongyuan Zha
193
Voted
ICML
1996
IEEE
16 years 8 months ago
On the Learnability of the Uncomputable
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
Richard H. Lathrop
SIGSOFT
2009
ACM
16 years 8 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang
SIGSOFT
2008
ACM
16 years 8 months ago
Automatically locating framework extension examples
Using and extending a framework is a challenging task whose difficulty is exacerbated by the poor documentation that generally comes with the framework. Even in the presence of do...
Barthélémy Dagenais, Harold Ossher
« Prev « First page 2203 / 2683 Last » Next »