4325 search results - page 488 / 865 » Incremental computation with names |
166
click to vote
TIP
2011
15 years 1 months ago
2011
—Recently, in a previous work, we proposed a way to bound how well any given image can be denoised. The bound was computed directly from the noise-free image that was assumed to ...
168
click to vote
IJACT
2010
15 years 1 months ago
2010
: We study the interplay of network connectivity and the issues related to the `possibility', `feasibility' and `optimality' for unconditionally reliable message tra...
173
click to vote
INTERSPEECH
2010
15 years 1 months ago
2010
In this paper, we present efficient HMM-based techniques for estimating missing features. By assuming speech features to be observations of hidden Markov processes, we derive a mi...
189
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
173
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The recent upsurge of research toward compressive sampling and parsimonious signal representations hinges on signals being sparse, either naturally, or, after projecting them on a...