Sciweavers

1070 search results - page 169 / 214
» Type Classes with Functional Dependencies
Sort
View
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 9 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
CORR
2006
Springer
82views Education» more  CORR 2006»
13 years 7 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
SIAMDM
2008
148views more  SIAMDM 2008»
13 years 7 months ago
A New Algorithm for On-line Coloring Bipartite Graphs
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
Hajo Broersma, Agostino Capponi, Daniël Paulu...
RTS
2006
176views more  RTS 2006»
13 years 7 months ago
Verifying distributed real-time properties of embedded systems via graph transformations and model checking
Component middleware provides dependable and efficient platforms that support key functional, and quality of service (QoS) needs of distributed real-time embedded (DRE) systems. C...
Gabor Madl, Sherif Abdelwahed, Douglas C. Schmidt
CSDA
2011
13 years 2 months ago
Approximate forward-backward algorithm for a switching linear Gaussian model
Motivated by the application of seismic inversion in the petroleum industry we consider a hidden Markov model with two hidden layers. The bottom layer is a Markov chain and given ...
Hugo Hammer, Håkon Tjelmeland