Sciweavers

91 search results - page 11 / 19
» Information-theoretic approaches to branching in search
Sort
View
ICML
2010
IEEE
14 years 10 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
ISSTA
2010
ACM
14 years 11 months ago
OCAT: object capture-based automated testing
Testing object-oriented (OO) software is critical because OO languages are commonly used in developing modern software systems. In testing OO software, one important and yet chall...
Hojun Jaygarl, Sunghun Kim, Tao Xie, Carl K. Chang
86
Voted
ECCV
2010
Springer
15 years 1 months ago
Efficient Inference with Multiple Heterogeneous Part Detectors for Human Pose Estimation
We address the problem of estimating human pose in a single image using a part based approach. Pose accuracy is directly affected by the accuracy of the part detectors but more acc...
CP
2004
Springer
15 years 2 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
ICCV
2009
IEEE
16 years 2 months ago
Multimodal Partial Estimates Fusion
Fusing partial estimates is a critical and common problem in many computer vision tasks such as part-based detection and tracking. It generally becomes complicated and intractab...
Jiang Xu, Junsong Yuan, YingWu