3630 search results - page 131 / 726 » Fast Marching Methods |
122
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider the distributed compression of two (binary memoryless) correlated sources and propose a unique codec that can reach any point in the Slepian-Wolf region. In a previous...
87
Voted
ICMCS
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
128
Voted
INTERSPEECH
2010
14 years 9 months ago
2010
In this paper we evaluate a method for generating synthetic speech at high speaking rates based on the interpolation of hidden semi-Markov models (HSMMs) trained on speech data re...
134
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In this work a new online learning algorithm that uses automatic relevance determination (ARD) is proposed for fast adaptive nonlinear filtering. A sequential decision rule for i...
122
Voted
JCPHY
2011
14 years 5 months ago
2011
This paper is concerned with the fast solution of high frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional ...