Sciweavers

1067 search results - page 77 / 214
» Probabilistic regular graphs
Sort
View
AML
2010
98views more  AML 2010»
15 years 3 months ago
Small universal families for graphs omitting cliques without GCH
When no single universal model for a set of structures exists at a given cardinal, then one may ask in which models of set theory does there exist a small family which embeds the r...
Katherine Thompson
ENTCS
2002
110views more  ENTCS 2002»
15 years 2 months ago
Uniform Solution of Parity Games on Prefix-Recognizable Graphs
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
Thierry Cachat
DM
2008
94views more  DM 2008»
15 years 3 months ago
On low degree k-ordered graphs
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
Karola Mészáros
DM
2008
73views more  DM 2008»
15 years 3 months ago
Graphs with the n-e.c. adjacency property constructed from affine planes
We give new examples of graphs with the n-e.c. adjacency property. Few explicit families of n-e.c. graphs are known, despite the fact that almost all finite graphs are n-e.c. Our ...
C. A. Baker, Anthony Bonato, Julia M. Nowlin Brown...
KI
2009
Springer
15 years 9 months ago
Maximum a Posteriori Estimation of Dynamically Changing Distributions
This paper presents a sequential state estimation method with arbitrary probabilistic models expressing the system’s belief. Probabilistic models can be estimated by Maximum a po...
Michael Volkhardt, Sören Kalesse, Steffen M&u...