1578 search results - page 111 / 316 » Algorithmic randomness of continuous functions |
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...
CVPR
2005
IEEE
15 years 12 months ago
2005
IEEE
The problem of low-rank matrix factorization in the presence of missing data has seen significant attention in recent computer vision research. The approach that dominates the lit...
DAGM
2008
Springer
14 years 11 months ago
2008
Springer
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
ICIAP
2005
ACM
15 years 10 months ago
2005
ACM
Abstract. This paper presents an optimisation technique to select automatically a set of control parameters for a Markov Random Field applied to stereo matching. The method is base...
103
click to vote
CAV
2006
Springer
15 years 1 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...