Sciweavers

2961 search results - page 7 / 593
» Optimization of tele-immersion codes
Sort
View
AAAI
2011
12 years 7 months ago
Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
Xinhua Zhang, Yaoliang Yu, Martha White, Ruitong H...
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification
Abstract The optimal one-error-correcting codes of length 13 that are doubly shortened perfect codes are classified utilizing the results of [
Patric R. J. Östergård, Olli Pottonen
TIT
2011
169views more  TIT 2011»
13 years 2 months ago
Network Coding Theory Via Commutative Algebra
—The fundamental result of linear network coding asserts the existence of optimal codes over acyclic networks when the symbol field is sufficiently large. The restriction to just...
Shuo-Yen Robert Li, Qifu Tyler Sun
TIT
2010
80views Education» more  TIT 2010»
13 years 2 months ago
Optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4
An optical orthogonal signature pattern code (OOSPC) finds application in transmitting 2-dimensional images through multicore fiber in code-division multiple-access (CDMA) communic...
Masanori Sawa