Sciweavers

564 search results - page 28 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
TASLP
2011
13 years 2 months ago
Time-Frequency Cepstral Features and Heteroscedastic Linear Discriminant Analysis for Language Recognition
Abstract—The shifted delta cepstrum (SDC) is a widely used feature extraction for language recognition (LRE). With a high context width due to incorporation of multiple frames, S...
Weiqiang Zhang, Liang He, Yan Deng, Jia Liu, M. T....
ICS
2003
Tsinghua U.
14 years 1 months ago
Estimating cache misses and locality using stack distances
Cache behavior modeling is an important part of modern optimizing compilers. In this paper we present a method to estimate the number of cache misses, at compile time, using a mac...
Calin Cascaval, David A. Padua
PDPTA
2007
13 years 9 months ago
A Parallel Algorithm for Discrete Gabor Transforms
- Serial algorithms to evaluate the Gabor transform of a discrete signal are bound by the length of signal for which the transform can be evaluated. The time taken, if machine memo...
Kshitij Sudan, Nipun Saggar, Asok De
ICIP
2003
IEEE
14 years 1 months ago
K-Voronoi diagrams computing in arbitrary domains
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation ca...
Rubén Cárdenes, Simon K. Warfield, A...
TAMC
2010
Springer
13 years 6 months ago
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
Pinar Heggernes, Daniel Meister, Udi Rotics