Sciweavers

569 search results - page 70 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
SIGPRO
2010
99views more  SIGPRO 2010»
14 years 8 months ago
Oversampled phase tracking in digital communications with large excess bandwidth
This paper deals with the on-line carrier phase estimation in a digital receiver. We consider a Brownian phase evolution in a Data Aided scenario. The proposed study uses an overs...
Jordi Vilà-Valls, Jean-Marc Brossier, Laure...
AI
2008
Springer
14 years 10 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson
COLT
2001
Springer
15 years 2 months ago
Smooth Boosting and Learning with Malicious Noise
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm ...
Rocco A. Servedio
ICML
2006
IEEE
15 years 10 months ago
Algorithms for portfolio management based on the Newton method
We experimentally study on-line investment algorithms first proposed by Agarwal and Hazan and extended by Hazan et al. which achieve almost the same wealth as the best constant-re...
Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. S...
SODA
1996
ACM
101views Algorithms» more  SODA 1996»
14 years 11 months ago
Randomized Robot Navigation Algorithms
We consider the problem faced by a mobile robot that has to reach a given target by traveling through an unmapped region in the plane containing oriented rectangular obstacles. We...
Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Kar...