Sciweavers

1529 search results - page 27 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
CVPR
2010
IEEE
14 years 4 months ago
A Constant-Space Belief Propagation Algorithm for Stereo Matching
In this paper, we consider the problem of stereo matching using loopy belief propagation. Unlike previous methods which focus on the original spatial resolution, we hierarchically...
Qingxiong Yang, Liang Wang, Narendra Ahuja
AAAI
1994
13 years 9 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 2 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
ICC
2007
IEEE
186views Communications» more  ICC 2007»
14 years 1 months ago
Bit Error Performance of Orthogonal Space-Time Block Codes over Time-Selective Channel
— Most of the existing works on space-time block codes (STBC) assume the channels are quasi-static, i.e., they remain invariant within one block. This assumption is not always tr...
Jun He, Pooi Yuen Kam
ICANN
2005
Springer
14 years 1 months ago
Handwritten Digit Recognition with Nonlinear Fisher Discriminant Analysis
Abstract. To generalize the Fisher Discriminant Analysis (FDA) algorithm to the case of discriminant functions belonging to a nonlinear, finite dimensional function space F (Nonli...
Pietro Berkes