Sciweavers

484 search results - page 43 / 97
» The number of convex permutominoes
Sort
View
SIAMJO
2011
13 years 28 days ago
Rank-Sparsity Incoherence for Matrix Decomposition
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Pa...
AAECC
2002
Springer
126views Algorithms» more  AAECC 2002»
13 years 10 months ago
Toric Varieties Hirzebruch Surfaces and Error-Correcting Codes
Abstract. For any integral convex polytope in R2 there is an explicit construction of an error-correcting code of length (q - 1)2 over the finite field Fq, obtained by evaluation o...
Johan P. Hansen
COLT
2004
Springer
14 years 3 months ago
Performance Guarantees for Regularized Maximum Entropy Density Estimation
Abstract. We consider the problem of estimating an unknown probability distribution from samples using the principle of maximum entropy (maxent). To alleviate overfitting with a v...
Miroslav Dudík, Steven J. Phillips, Robert ...
TWC
2010
13 years 4 months ago
On overloaded vector precoding for single-user MIMO channels
We address the possibility of overloaded vector precoding in single user MIMO channels, i.e. the number of data streams is larger than the minimum of the number of antennas at tran...
R. De Miguel, Vesna Gardasevic, Ralf R. Mülle...
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
13 years 11 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri