Sciweavers

873 search results - page 57 / 175
» Rates of convergence for Quicksort
Sort
View
ICASSP
2009
IEEE
15 years 6 months ago
The speed of greed: Characterizing myopic gossip through network voracity
This paper analyzes the rate of convergence of greedy gossip with eavesdropping (GGE). In previous work, we proposed GGE, a fast gossip algorithm based on exploiting the broadcast...
Deniz Üstebay, Boris N. Oreshkin, Mark Coates...
GLOBECOM
2006
IEEE
15 years 6 months ago
Adaptive Learning of Transmission Control Policies for MIMO Fading Channels under Delay Constraint
— This paper addresses learning based adaptive resource allocation for wireless MIMO channels with Markovian fading. The problem is posed as Constrained Markov Decision Process w...
Dejan V. Djonin, Vikram Krishnamurthy
AE
2005
Springer
15 years 5 months ago
Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
Anne Auger, Mohamed Jebalia, Olivier Teytaud
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
14 years 9 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
ICIP
2009
IEEE
14 years 9 months ago
Total variation projection with first order schemes
This article proposes a new algorithm to compute the projection on the set of images whose total variation is bounded by a constant. The projection is computed through a dual form...
Mohamed-Jalal Fadili, Gabriel Peyré