Sciweavers

143 search results - page 21 / 29
» Bisimulation for Labelled Markov Processes
Sort
View
DAGM
2008
Springer
13 years 9 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr
CORR
2012
Springer
183views Education» more  CORR 2012»
12 years 3 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar
ICASSP
2009
IEEE
13 years 5 months ago
Applying discretized articulatory knowledge to dysarthric speech
This paper applies two dynamic Bayes networks that include theoretical and measured kinematic features of the vocal tract, respectively, to the task of labeling phoneme sequences ...
Frank Rudzicz
MPC
2010
Springer
181views Mathematics» more  MPC 2010»
14 years 9 days ago
Process Algebras for Collective Dynamics
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
Jane Hillston
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
14 years 1 months ago
ATNoSFERES revisited
ATNoSFERES is a Pittsburgh style Learning Classifier System (LCS) in which the rules are represented as edges of an Augmented Transition Network. Genotypes are strings of tokens ...
Samuel Landau, Olivier Sigaud, Marc Schoenauer