Sciweavers

172 search results - page 11 / 35
» Testing Reactive Probabilistic Processes
Sort
View
MDM
2009
Springer
116views Communications» more  MDM 2009»
14 years 1 months ago
Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
Yuichi Iijima, Yoshiharu Ishikawa
QEST
2005
IEEE
14 years 29 days ago
An approximation algorithm for labelled Markov processes: towards realistic approximation
Abstract— Approximation techniques for labelled Markov processes on continuous state spaces were developed by Desharnais, Gupta, Jagadeesan and Panangaden. However, it has not be...
Alexandre Bouchard-Côté, Norm Ferns, ...
NIPS
2007
13 years 8 months ago
Inferring Neural Firing Rates from Spike Trains Using Gaussian Processes
Neural spike trains present challenges to analytical efforts due to their noisy, spiking nature. Many studies of neuroscientific and neural prosthetic importance rely on a smooth...
John P. Cunningham, Byron M. Yu, Krishna V. Shenoy...
ICASSP
2011
IEEE
12 years 11 months ago
Adaptive harmonic time-frequency decomposition of audio using shift-invariant PLCA
This paper presents a new algorithm based on shift-invariant probabilistic latent component analysis that analyzes harmonic structures in an audio signal. Each note in a constant-...
Benoit Fuentes, Roland Badeau, Gaël Richard
AAAI
1998
13 years 8 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman