Sciweavers

224 search results - page 39 / 45
» Bounding Learning Time in XCS
Sort
View
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
13 years 8 months ago
Towards memoryless model building
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
David Iclanzan, Dumitru Dumitrescu
MLDM
2010
Springer
13 years 2 months ago
The Impact of Experimental Setup in Prepaid Churn Prediction for Mobile Telecommunications: What to Predict, for Whom and Does t
Prepaid customers in mobile telecommunications are not bound by a contract and can therefore change operators (`churn') at their convenience and without notification. This mak...
Dejan Radosavljevik, Peter van der Putten, Kim Kyl...
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 11 months ago
Sporadic model building for efficiency enhancement of hierarchical BOA
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
Martin Pelikan, Kumara Sastry, David E. Goldberg
CVPR
2004
IEEE
14 years 9 months ago
3D Facial Tracking from Corrupted Movie Sequences
In this paper we perform 3D face tracking on corrupted video sequences. We use a deformable model, combined with a predictive filter, to recover both the rigid transformations and...
Siome Goldenstein, Christian Vogler, Dimitris N. M...
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
14 years 4 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri