Sciweavers

224 search results - page 22 / 45
» Bounding Learning Time in XCS
Sort
View
JSAT
2006
88views more  JSAT 2006»
13 years 8 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva
COLT
2007
Springer
14 years 2 months ago
Improved Rates for the Stochastic Continuum-Armed Bandit Problem
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...
Peter Auer, Ronald Ortner, Csaba Szepesvári
CORR
2006
Springer
96views Education» more  CORR 2006»
13 years 8 months ago
How accurate are the time delay estimates in gravitational lensing?
We present a novel approach to estimate the time delay between light curves of multiple images in a gravitationally lensed system, based on Kernel methods in the context of machine...
Juan C. Cuevas-Tello, Peter Tino, Somak Raychaudhu...
JMLR
2010
140views more  JMLR 2010»
13 years 3 months ago
Mean Field Variational Approximation for Continuous-Time Bayesian Networks
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
Ido Cohn, Tal El-Hay, Nir Friedman, Raz Kupferman
ICCV
2005
IEEE
14 years 2 months ago
Learning Models for Predicting Recognition Performance
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
Rong Wang, Bir Bhanu