Sciweavers

3250 search results - page 158 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ICASSP
2008
IEEE
16 years 21 days ago
Decoding real-field codes by an iterative Expectation-Maximization (EM) algorithm
In this paper, a new approach for decoding real-field codes based on finding sparse solutions of underdetermined linear systems is proposed. This algorithm iteratively estimates...
Hadi Zayyani, Massoud Babaie-Zadeh, Christian Jutt...
ESANN
2008
15 years 7 months ago
A Regularized Learning Method for Neural Networks Based on Sensitivity Analysis
The Sensitivity-Based Linear Learning Method (SBLLM) is a learning method for two-layer feedforward neural networks, based on sensitivity analysis, that calculates the weights by s...
Bertha Guijarro-Berdiñas, Oscar Fontenla-Ro...
PAMI
2011
15 years 1 months ago
Linearized Motion Estimation for Articulated Planes
—In this paper, we describe the explicit application of articulation constraints for estimating the motion of a system of articulated planes. We relate articulations to the relat...
Ankur Datta, Yaser Sheikh, Takeo Kanade
CN
2002
82views more  CN 2002»
15 years 6 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer
FOCS
2002
IEEE
15 years 11 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich