Sciweavers

165 search results - page 17 / 33
» On Completing Latin Squares
Sort
View
COCOON
2003
Springer
15 years 5 months ago
Tetris is Hard, Even to Approximate
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configurat...
Erik D. Demaine, Susan Hohenberger, David Liben-No...
CORR
2010
Springer
255views Education» more  CORR 2010»
15 years 23 min ago
Scalable Tensor Factorizations for Incomplete Data
The problem of incomplete data--i.e., data with missing or unknown values--in multi-way arrays is ubiquitous in biomedical signal processing, network traffic analysis, bibliometri...
Evrim Acar, Tamara G. Kolda, Daniel M. Dunlavy, Mo...
98
Voted
COMBINATORICS
2007
60views more  COMBINATORICS 2007»
14 years 12 months ago
Higher Spin Alternating Sign Matrices
We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partia...
Roger E. Behrend, Vincent A. Knight
TALG
2008
67views more  TALG 2008»
14 years 11 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
TIT
2002
121views more  TIT 2002»
14 years 11 months ago
Asymptotic normality of linear multiuser receiver outputs
This paper proves large-system asymptotic normality of the output of a family of linear multiuser receivers that can be arbitrarily well approximated by polynomial receivers. This ...
Dongning Guo, Sergio Verdú, Lars K. Rasmuss...