Sciweavers

3373 search results - page 97 / 675
» Linear transformations on codes
Sort
View
ECSA
2007
Springer
15 years 9 months ago
Architecture Migration Driven by Code Categorization
Abstract. In this paper, we report on the development of a methodology for the evolution of software towards new architectures. In our approach, we represent source code as graphs....
Rui Correia, Carlos M. P. Matos, Reiko Heckel, Moh...
TIT
2008
83views more  TIT 2008»
15 years 3 months ago
Hard Problems of Algebraic Geometry Codes
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
Qi Cheng
INFOCOM
2002
IEEE
15 years 8 months ago
Beyond Routing: An Algebraic Approach to Network Coding
Abstract— In this paper we consider the issue of network capacity. The recent work by Li and Yeung examined the network capacity of multicast networks and related capacity to cut...
Muriel Médard, Ralf Koetter
IJCV
2008
155views more  IJCV 2008»
15 years 3 months ago
Fast Transformation-Invariant Component Analysis
For software and more illustrations: http://www.psi.utoronto.ca/anitha/fastTCA.htm Dimensionality reduction techniques such as principal component analysis and factor analysis are...
Anitha Kannan, Nebojsa Jojic, Brendan J. Frey
CORR
2007
Springer
146views Education» more  CORR 2007»
15 years 3 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang