Sciweavers

1298 search results - page 153 / 260
» The online set cover problem
Sort
View
ICIP
2010
IEEE
15 years 4 months ago
Towards computational models of kinship verification
We tackle the challenge of kinship verification using novel feature extraction and selection methods, automatically classifying pairs of face images as "related" or &quo...
Ruogu Fang, Kevin D. Tang, Noah Snavely, Tsuhan Ch...
COMCOM
1998
83views more  COMCOM 1998»
15 years 6 months ago
System for screening objectionable images
As computers and Internet become more and more available to families, access of objectionable graphics by children is increasingly a problem that many parents are concerned about....
James Ze Wang, Jia Li, Gio Wiederhold, Oscar Firsc...
ICAART
2010
INSTICC
16 years 3 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
ICRA
2010
IEEE
120views Robotics» more  ICRA 2010»
15 years 5 months ago
Approximation of feasibility tests for reactive walk on HRP-2
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
Nicolas Perrin, Olivier Stasse, Florent Lamiraux, ...
AUTOMATICA
2010
123views more  AUTOMATICA 2010»
15 years 4 months ago
On the computation of linear model predictive control laws
Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be transformed into Quadratic Programs (QPs). Model Predictive ...
Francesco Borrelli, Mato Baotic, Jaroslav Pekar, G...