Sciweavers

770 search results - page 50 / 154
» Latent Class Models for Algorithm Portfolio Methods
Sort
View
ICTAI
2009
IEEE
14 years 7 months ago
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Emmanuel Rachelson, Patrick Fabiani, Fréd&e...
ICPR
2004
IEEE
15 years 10 months ago
Data Dependent Classifier Fusion for Construction of Stable Effective Algorithms
A measure of stability for a wide class of pattern recognition algorithms is introduced to cope with overfitting in classification problems. Based on this concept, constructive me...
Dmitry Kropotov, Dmitry Vetrov
ECCV
2006
Springer
15 years 11 months ago
Sparse Flexible Models of Local Features
Abstract. In recent years there has been growing interest in recognition models using local image features for applications ranging from long range motion matching to object class ...
Gustavo Carneiro, David Lowe
BMCBI
2007
109views more  BMCBI 2007»
14 years 9 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
IEEECIT
2010
IEEE
14 years 7 months ago
The Research on Teaching Method of Basics Course of Computer based on Cluster Analysis
Due to the difference between rural and urban and regional disparity of computer basic education produced at their middle school period, computer application level of the freshmen ...
ZhiXin Tie, Rong Jin, Hong Zhuang, Zhaoqing Wang