Sciweavers

16430 search results - page 833 / 3286
» On Computable Tree Functions
Sort
View
ICASSP
2011
IEEE
14 years 11 months ago
Computing the nonnegative 3-way tensor factorization using Tikhonov regularization
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
Jean-Philip Royer, Pierre Comon, Nadège Thi...
ICANN
2011
Springer
14 years 11 months ago
Robot Trajectory Prediction and Recognition Based on a Computational Mirror Neurons Model
Mirror neurons are premotor neurons that are considered to play a role in goal-directed actions, action understanding and even social cognition. As one of the promising research ar...
Junpei Zhong, Cornelius Weber, Stefan Wermter
ICC
2007
IEEE
16 years 1 months ago
Computing the Optimal Amount of Constellation Distortion in OFDM Systems
Abstract— The primary disadvantage of orthogonal frequencydivision multiplexing (OFDM) is the high time-domain peak-toaverage power ratio (PAR) that severely limits the transmitt...
Alok Aggarwal, Erik R. Stauffer, Teresa H. Meng
ICC
2007
IEEE
147views Communications» more  ICC 2007»
16 years 1 months ago
MIMO OFDM Frequency Offset Estimator with Low Computational Complexity
— This paper addresses a low complexity frequency offset estimator for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems over freque...
Yanxiang Jiang, Xiaohu You, Xiqi Gao, Hlaing Minn
HICSS
2005
IEEE
146views Biometrics» more  HICSS 2005»
16 years 1 months ago
Maintaining Continuous Dependability in Sensor-Based Context-Aware Pervasive Computing Systems
Sensors are often indicative of events of interest, or events which a system should be aware of and should react to. In particular, such indications may reflect unsteadiness or in...
Amir Padovitz, Arkady B. Zaslavsky, Seng Wai Loke,...