283 search results - page 21 / 57 » Deterministic Polynomial Time Algorithms for Matrix Completi... |
169
click to vote
ICA
2004
Springer
15 years 11 months ago
2004
Springer
We address the blind source separation (BSS) problem for the convolutive mixing case. Second-order statistical methods are employed assuming the source signals are non-stationary a...
151
click to vote
ALGORITHMICA
2007
15 years 6 months ago
2007
— We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequen...
187
click to vote
ALGORITHMICA
2002
15 years 5 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
143
click to vote
COCO
2009
Springer
16 years 14 days ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
182
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...