Sciweavers

1067 search results - page 138 / 214
» Probabilistic regular graphs
Sort
View
109
Voted
ICALP
1997
Springer
15 years 4 months ago
Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
Olaf Burkart, Bernhard Steffen
72
Voted
ARSCOM
1998
79views more  ARSCOM 1998»
15 years 9 days ago
A characterization of halved cubes
The vertex set of a halved cube Qd consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then i...
Wilfried Imrich, Sandi Klavzar, Aleksander Vesel
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
15 years 8 days ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet
123
Voted
JMLR
2010
158views more  JMLR 2010»
14 years 7 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe
117
Voted
FQAS
2009
Springer
127views Database» more  FQAS 2009»
15 years 7 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...