Sciweavers

2370 search results - page 92 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 4 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
ICASSP
2011
IEEE
14 years 1 months ago
A time-warping framework for speech turbulence-noise component estimation during aperiodic phonation
The accurate estimation of turbulence noise affects many areas of speech processing including separate modification of the noise component, analysis of degree of speech aspiration...
Nicolas Malyska, Thomas F. Quatieri
ICASSP
2011
IEEE
14 years 1 months ago
Sparse coding and dictionary learning based on the MDL principle
The power of sparse signal coding with learned overcomplete dictionaries has been demonstrated in a variety of applications and fields, from signal processing to statistical infe...
Ignacio Ramírez, Guillermo Sapiro
CORR
2012
Springer
171views Education» more  CORR 2012»
13 years 5 months ago
Random Feature Maps for Dot Product Kernels
Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and...
Purushottam Kar, Harish Karnick
HPDC
2012
IEEE
13 years 7 days ago
Exploring the performance and mapping of HPC applications to platforms in the cloud
This paper presents a scheme to optimize the mapping of HPC applications to a set of hybrid dedicated and cloud resources. First, we characterize application performance on dedica...
Abhishek Gupta, Laxmikant V. Kalé, Dejan S....