Sciweavers

42 search results - page 2 / 9
» Separating points by axis-parallel lines
Sort
View
JUCS
2010
117views more  JUCS 2010»
13 years 4 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...
IJCGA
2006
85views more  IJCGA 2006»
13 years 6 months ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
ICA
2004
Springer
13 years 11 months ago
A Geometric Approach for Separating Several Speech Signals
In this paper a new geometrical approach for separating speech signals is presented. This approach can be directly applied to separate more than two speech signals. It is based on ...
Massoud Babaie-Zadeh, Ali Mansour, Christian Jutte...
ICA
2004
Springer
13 years 11 months ago
Soft-LOST: EM on a Mixture of Oriented Lines
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
Paul D. O'Grady, Barak A. Pearlmutter
ICASSP
2010
IEEE
13 years 6 months ago
A new method for kurtosis maximization and source separation
This paper introduces a new method to maximize kurtosisbased contrast functions. Such contrast functions appear in the problem of blind source separation of convolutively mixed so...
Marc Castella, Eric Moreau