2436 search results - page 393 / 488 » Evaluating Adaptive Problem Selection |
120
click to vote
CVPR
1996
IEEE
16 years 4 months ago
1996
IEEE
Despite many successful applications of robust statistics, they have yet to be completely adapted to many computer vision problems. Range reconstruction, particularly in unstructu...
128
click to vote
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
Most existing subspace analysis-based tracking algorithms utilize a flattened vector to represent a target, resulting in a high dimensional data learning problem. Recently, subspa...
126
Voted
ICPR
2004
IEEE
16 years 3 months ago
2004
IEEE
Most face recognition approaches either assume constant lighting condition or standard facial expressions, thus cannot deal with both kinds of variations simultaneously. This prob...
122
click to vote
DAC
2009
ACM
16 years 3 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
151
click to vote
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
We consider the problem of multi-task reinforcement learning, where the agent needs to solve a sequence of Markov Decision Processes (MDPs) chosen randomly from a fixed but unknow...