Sciweavers

14158 search results - page 245 / 2832
» Generalized switch-setting problems
Sort
View
ICA
2007
Springer
15 years 10 months ago
Solving the Permutation Problem in Convolutive Blind Source Separation
Abstract. This paper presents a new algorithm for solving the permutation ambiguity in convolutive blind source separation. When transformed to the frequency domain, the source sep...
Radoslaw Mazur, Alfred Mertins
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
15 years 10 months ago
A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
Sung Eun Bae, Tadao Takaoka
LICS
2006
IEEE
15 years 10 months ago
A Characterisation of First-Order Constraint Satisfaction Problems
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
Benoit Larose, Cynthia Loten, Claude Tardif
DOCENG
2006
ACM
15 years 10 months ago
Solving the simple continuous table layout problem
Automatic table layout is required in web applications. Unfortunately, this is NP-hard for reasonable layout requirements such as minimizing table height for a given width. One ap...
Nathan Hurst, Kim Marriott, David W. Albrecht
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 9 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...