Sciweavers

167 search results - page 20 / 34
» Convergence rate and termination of asynchronous iterative a...
Sort
View
SIAMMAX
2011
141views more  SIAMMAX 2011»
12 years 10 months ago
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
Mariya Ishteva, Pierre-Antoine Absil, Sabine Van H...
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
14 years 4 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein
IPL
2008
146views more  IPL 2008»
13 years 7 months ago
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
Nattapat Attiratanasunthron, Jittat Fakcharoenphol
ICASSP
2010
IEEE
13 years 5 months ago
Efficient online learning with individual learning-rates for phoneme sequence recognition
We describe a fast and efficient online algorithm for phoneme sequence speech recognition. Our method is using a discriminative training to update the model parameters one utteran...
Koby Crammer
CVPR
2008
IEEE
14 years 9 months ago
Generalised blurring mean-shift algorithms for nonparametric clustering
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
Miguel Á. Carreira-Perpiñán