1024 search results - page 63 / 205 » The Generalized PatchMatch Correspondence Algorithm |
ICANNGA
2007
Springer
15 years 1 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
101
click to vote
FGR
2004
IEEE
15 years 1 months ago
2004
IEEE
The major challenges that sign language recognition (SLR) now faces are developing methods that solve large vocabulary continuous sign problems. In this paper, large vocabulary co...
102
click to vote
AAAI
2008
15 years 4 days ago
2008
Fisher score and Laplacian score are two popular feature selection algorithms, both of which belong to the general graph-based feature selection framework. In this framework, a fe...
ACSD
2007
IEEE
14 years 11 months ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
AAAI
2006
14 years 11 months ago
2006
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...