Sciweavers

6045 search results - page 132 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
TSP
2010
13 years 2 months ago
Two-channel linear phase FIR QMF bank minimax design via global nonconvex optimization programming
In this correspondence, a two-channel linear phase finite impulse response (FIR) quadrature mirror filter (QMF) bank minimax design problem is formulated as a nonconvex optimizati...
Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling, Lamia ...
ICASSP
2011
IEEE
12 years 11 months ago
Discriminatively trained Probabilistic Linear Discriminant Analysis for speaker verification
Recently, i-vector extraction and Probabilistic Linear Discriminant Analysis (PLDA) have proven to provide state-of-the-art speaker verification performance. In this paper, the s...
Lukas Burget, Oldrich Plchot, Sandro Cumani, Ondre...
ICASSP
2011
IEEE
12 years 11 months ago
Extended array method for detection and direction finding of a weak linear frequency modulated signal
A well known computationally efficient method for parameters estimation of linear frequency modulated (LFM) signals is to mix the received signals with a shifted version of itsel...
Songsri Sirianunpiboon
COMPGEOM
2010
ACM
14 years 26 days ago
Computing similarity between piecewise-linear functions
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreve...
POPL
2010
ACM
14 years 2 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak