91 search results - page 11 / 19 » Information-theoretic approaches to branching in search |
81
Voted
ICML
2010
IEEE
15 years 22 days ago
2010
IEEE
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...
111
Voted
ISSTA
2010
ACM
15 years 1 months ago
2010
ACM
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...
100
click to vote
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
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...
147
Voted
CP
2004
Springer
15 years 5 months ago
2004
Springer
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 ...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
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...