641 search results - page 93 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
113
click to vote
HAIS
2010
Springer
14 years 7 months ago
2010
Springer
In this article, we describe a feature selection algorithm which can automatically find relevant features for multiple instance learning. Multiple instance learning is considered a...
UAI
2003
14 years 11 months ago
2003
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
PAA
2002
14 years 9 months ago
2002
: The idea of performing model combination, instead of model selection, has a long theoretical background in statistics. However, making use of theoretical results is ordinarily su...
ICSE
2008
IEEE-ACM
15 years 9 months ago
2008
IEEE-ACM
Conducting controlled experiments about programming activities often requires the use of multiple tasks of similar difficulty. In previously reported work about a controlled exper...