Sciweavers

279 search results - page 4 / 56
» Type-II Optimal Polynomial Bases
Sort
View
GECCO
2004
Springer
13 years 11 months 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
IJON
2006
96views more  IJON 2006»
13 years 5 months ago
Quasi-optimal EASI algorithm based on the Score Function Difference (SFD)
Equivariant Adaptive Separation via Independence (EASI) is one of the most successful algorithms for Blind Source Separation (BSS). However, the user has to choose nonlinearities,...
Samareh Samadi, Massoud Babaie-Zadeh, Christian Ju...
ICASSP
2010
IEEE
13 years 6 months ago
Empirical Type-i filter design for image interpolation
Empirical filter designs generalize relationships inferred from training data to effect realistic solutions that conform well to the human visual system. Complex algorithms invol...
Karl S. Ni, Truong Q. Nguyen
FCCM
2009
IEEE
106views VLSI» more  FCCM 2009»
13 years 9 months ago
Optimal Placement-aware Trace-Based Scheduling of Hardware Reconfigurations for FPGA Accelerators
Modern use of FPGAs as hardware accelerators involves the partial reconfiguration of hardware resources as the application executes. In this paper, we present a polynomial time al...
Joon Edward Sim, Weng-Fai Wong, Jürgen Teich
COLT
2005
Springer
13 years 11 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon