Sciweavers

1243 search results - page 200 / 249
» Generating Trees on Multisets
Sort
View
ICML
1999
IEEE
15 years 10 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
ICSE
2009
IEEE-ACM
15 years 10 months ago
Analyzing critical process models through behavior model synthesis
Process models capture tasks performed by agents together with their control flow. Building and analyzing such models is important but difficult in certain areas such as safety-cr...
Christophe Damas, Bernard Lambeau, Francois Roucou...
POPL
2009
ACM
15 years 10 months ago
Types and higher-order recursion schemes for verification of higher-order programs
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
Naoki Kobayashi
PPOPP
2009
ACM
15 years 10 months ago
How much parallelism is there in irregular applications?
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
Milind Kulkarni, Martin Burtscher, Rajeshkar Inkul...
KDD
2004
ACM
314views Data Mining» more  KDD 2004»
15 years 10 months ago
Assessment of discretization techniques for relevant pattern discovery from gene expression data
In the domain of gene expression data analysis, various researchers have recently emphasized the promising application of pattern discovery techniques like association rule mining...
Ruggero G. Pensa, Claire Leschi, Jéré...