Sciweavers

14165 search results - page 605 / 2833
» The generalized two-server problem
Sort
View
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 9 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
ATAL
2007
Springer
16 years 1 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone

Book
357views
17 years 5 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang
ICCV
2003
IEEE
16 years 9 months ago
Boosting Chain Learning for Object Detection
A general classification framework, called boosting chain, is proposed for learning boosting cascade. In this framework, a "chain" structure is introduced to integrate h...
Rong Xiao, Long Zhu, HongJiang Zhang
ICIP
2003
IEEE
16 years 8 months ago
A variational method for Bayesian blind image deconvolution
In this paper the blind image deconvolution (BID) problem is solved using the Bayesian framework. In order to find the parameters of the proposed Bayesian model we present a new g...
Aristidis Likas, Nikolas P. Galatsanos