Sciweavers

16093 search results - page 378 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
264
Voted
ICASSP
2011
IEEE
14 years 10 months ago
Efficient image reconstruction under sparsity constraints with application to MRI and bioluminescence tomography
Most bioimaging modalities rely on indirect measurements of the quantity under investigation. The image is obtained as the result of an optimization problem involving a physical m...
Matthieu Guerquin-Kern, Jean-Charles Baritaux, Mic...
253
Voted
PEPM
2011
ACM
14 years 9 months ago
Allocation removal by partial evaluation in a tracing JIT
The performance of many dynamic language implementations suffers from high allocation rates and runtime type checks. This makes dynamic languages less applicable to purely algorit...
Carl Friedrich Bolz, Antonio Cuni, Maciej FijaBkow...
CORR
2012
Springer
192views Education» more  CORR 2012»
14 years 2 months ago
The best of both worlds: stochastic and adversarial bandits
We present a bandit algorithm, SAO (Stochastic and Adversarial Optimal), whose regret is, essentially, optimal both for adversarial rewards and for stochastic rewards. Specifical...
Sébastien Bubeck, Aleksandrs Slivkins
IPPS
2006
IEEE
16 years 27 days ago
An optimal architecture for a DDC
Digital Down Conversion (DDC) is an algorithm, used to lower the amount of samples per second by selecting a limited frequency band out of a stream of samples. A possible DDC algo...
Tjerk Bijlsma, Pascal T. Wolkotte, Gerard J. M. Sm...
TWC
2010
15 years 1 months ago
Distributed Node Selection for Sequential Estimation over Noisy Communication Channels
This paper proposes a framework for distributed sequential parameter estimation in wireless sensor networks. In the proposed scheme, the estimator is updated sequentially at the c...
Thakshila Wimalajeewa, Sudharman K. Jayaweera