Sciweavers

582 search results - page 100 / 117
» What Will Probably Happen
Sort
View
ICASSP
2010
IEEE
13 years 8 months ago
Optimal delayed decoding of predictively encoded sources
Predictive coding eliminates redundancy due to correlations between the current and past signal samples, so that only the innovation, or prediction residual, needs to be encoded. ...
Vinay Melkote, Kenneth Rose
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 8 months ago
How to beat the sphere-packing bound with feedback
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...
Anant Sahai
SCL
2008
76views more  SCL 2008»
13 years 7 months ago
Probabilistic output admissible set for systems with time-varying uncertainties
This paper considers time-varying uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set. This set consists of the initial ...
Takeshi Hatanaka, Kiyotsugu Takaba
CVIU
2004
155views more  CVIU 2004»
13 years 7 months ago
Object of interest-based visual navigation, retrieval, and semantic content identification system
This study presents a content-based image retrieval system IMALBUM based on local region of interest called object of interest (OOI). Each segmented or user-selected OOI is indexe...
Khalid Idrissi, Guillaume Lavoué, Julien Ri...
CSL
2000
Springer
13 years 7 months ago
Efficient speech recognition using subvector quantization and discrete-mixture HMMS
This paper introduces a new form of observation distributions for hidden Markov models (HMMs), combining subvector quantization and mixtures of discrete distrib utions. Despite w...
Vassilios Digalakis, S. Tsakalidis, Costas Harizak...