Sciweavers

3533 search results - page 396 / 707
» Locally Optimized RANSAC
Sort
View
GECCO
2004
Springer
16 years 5 days ago
On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains
We analyse the probability 1 − δ to be in an optimum solution after k steps of an inhomogeneous Markov chain which is specified by a logarithmic cooling schedule c(k) = Γ/ ln ...
Andreas Alexander Albrecht
GECCO
2004
Springer
16 years 5 days ago
A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model
Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...
Simon Fischer
ICA
2004
Springer
16 years 5 days ago
Approximate Joint Diagonalization Using a Natural Gradient Approach
We present a new algorithm for non-unitary approximate joint diagonalization (AJD), based on a “natural gradient”-type multiplicative update of the diagonalizing matrix, comple...
Arie Yeredor, Andreas Ziehe, Klaus-Robert Mül...
WG
2004
Springer
16 years 4 days ago
Crossing Reduction in Circular Layouts
We propose a two-phase heuristic for crossing reduction in circular layouts. While the first algorithm uses a greedy policy to build a good initial layout, an adaptation of the si...
Michael Baur, Ulrik Brandes
DATE
2003
IEEE
109views Hardware» more  DATE 2003»
16 years 3 days ago
Data Space Oriented Scheduling in Embedded Systems
With the widespread use of embedded devices such as PDAs, printers, game machines, cellular telephones, achieving high performance demands an optimized operating system (OS) that ...
Mahmut T. Kandemir, Guangyu Chen, Wei Zhang 0002, ...