Sciweavers

1147 search results - page 154 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
ATAL
2007
Springer
13 years 11 months ago
Confidence-based policy learning from demonstration using Gaussian mixture models
We contribute an approach for interactive policy learning through expert demonstration that allows an agent to actively request and effectively represent demonstration examples. I...
Sonia Chernova, Manuela M. Veloso
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
Hybrid Numerical Solution of the Chemical Master Equation
We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe networks of biochemical reactions and play an important role in the ...
Thomas A. Henzinger, Maria Mateescu, Linar Mikeev,...
PODS
2012
ACM
276views Database» more  PODS 2012»
11 years 10 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
A Spectral Algorithm for Learning Hidden Markov Models
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
Daniel Hsu, Sham M. Kakade, Tong Zhang
TSP
2010
13 years 2 months ago
Universal randomized switching
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
Suleyman Serdar Kozat, Andrew C. Singer