Sciweavers

10901 search results - page 156 / 2181
» Approximations in Distributed Optimization
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Toward Off-Policy Learning Control with Function Approximation
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
Hamid Reza Maei, Csaba Szepesvári, Shalabh ...
ICPR
2008
IEEE
16 years 7 months ago
Time-series clustering by approximate prototypes
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
Pasi Fränti, Pekka Nykänen, Ville Hautam...
ICPR
2010
IEEE
16 years 1 months ago
Fast and Accurate Approximation of the Euclidean Opening Function in Arbitrary Dimension
In this paper, we present a fast and accurate approximation of the Euclidean opening function which is a wide-used tool in morphological mathematics to analyze binary shapes since...
David Coeurjolly
ICC
2007
IEEE
117views Communications» more  ICC 2007»
16 years 24 days ago
On the Fade Duration Distribution in Nakagami Fading Channels
− During almost fifty years the Fade Duration Distribution (FDD) of random signals has been an open research topic. However, for Nakagami fading channels, and in general for the ...
A. F. Ramos-Alarcón, Valeri Ya. Kontorovitc...
ENTCS
2007
85views more  ENTCS 2007»
15 years 6 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch