43 search results - page 4 / 9 » Polynomial-time theory of matrix groups |
TCS
2002
13 years 5 months ago
2002
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
SIGMOD
2009
ACM
14 years 6 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
ICC
2008
IEEE
14 years 12 days ago
2008
IEEE
Abstract— Joint eigenvalue distribution of the noncentral complex Wishart matrix, i.e. HH∗ where H is the nonzero-mean complex Gaussian random channel matrix of a multiple-inpu...
COMPGEOM
2011
ACM
12 years 9 months ago
2011
ACM
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
APPROX
2009
Springer
14 years 16 days ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...