1041 search results - page 158 / 209 » Randomizing Reductions of Search Problems |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
ICPR
2010
IEEE
14 years 2 months ago
2010
IEEE
In this paper, we propose a probabilistic method to model the dynamic traffic flow across nonoverlapping camera views. By assuming the transition time of object movement follows a...
AUSDM
2007
Springer
14 years 1 months ago
2007
Springer
The detection of unusual or anomalous data is an important function in automated data analysis or data mining. However, the diversity of anomaly detection algorithms shows that it...
ICAISC
2010
Springer
14 years 17 days ago
2010
Springer
In the paper a new evolutionary algorithm for induction of univariate regression trees is proposed. In contrast to typical top-down approaches it globally searches for the best tre...
HICSS
1997
IEEE
14 years 2 hour ago
1997
IEEE
The value for decision making of high-quality postsolution analysis of decision-supporting models can hardly be overestimated. Candle-lighting analysis (CLA) takes this notion ver...