Sciweavers

360 search results - page 30 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
ICML
1999
IEEE
14 years 9 months ago
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
Sebastian Thrun, John Langford, Dieter Fox
CDC
2009
IEEE
14 years 1 months ago
Dynamic practical stabilization of sampled-data linear distributed parameter systems
Abstract— In this paper, dynamic practical stability properties of infinite-dimensional sampled-data systems are discussed. A family of finite-dimensional discrete-time control...
Ying Tan, Emmanuel Trélat, Yacine Chitour, ...
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
14 years 8 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
TSP
2011
230views more  TSP 2011»
13 years 3 months ago
Bayesian Nonparametric Inference of Switching Dynamic Linear Models
—Many complex dynamical phenomena can be effectively modeled by a system that switches among a set of conditionally linear dynamical modes. We consider two such models: the switc...
Emily B. Fox, Erik B. Sudderth, Michael I. Jordan,...
ICASSP
2008
IEEE
14 years 3 months ago
Query adaptative locality sensitive hashing
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
Herve Jegou, Laurent Amsaleg, Cordelia Schmid, Pat...