Sciweavers

243 search results - page 35 / 49
» Linear Network Codes and Systems of Polynomial Equations
Sort
View
HAPTICS
2009
IEEE
16 years 22 days ago
Perceptual coding of haptic data in time-delayed teleoperation
In telepresence and teleaction systems the haptic communication channel plays a central role. As it closes a global control loop any introduced communication delay possibly destab...
Iason Vittorias, Julius Kammerl, Sandra Hirche, Ec...
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
15 years 10 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
WCNC
2008
IEEE
16 years 11 days ago
Three-Stage Serially Concatenated Codes and Iterative Center-Shifting K-Best Sphere Detection for SDM-OFDM: An EXIT Chart Aided
—Iterative K-best sphere detection (SD) and channel decoding is appealing, since it is capable of achieving a nearmaximum-a-posteriori (MAP) performance at a low complexity. Howe...
Li Wang, Lei Xu, Sheng Chen, Lajos Hanzo
PRL
2011
15 years 28 days ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
JMLR
2006
389views more  JMLR 2006»
15 years 6 months ago
A Very Fast Learning Method for Neural Networks Based on Sensitivity Analysis
This paper introduces a learning method for two-layer feedforward neural networks based on sensitivity analysis, which uses a linear training algorithm for each of the two layers....
Enrique Castillo, Bertha Guijarro-Berdiñas,...