Results 1  10
of
4,113
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
fields, including bioinformatics, communication theory, statistical physics, combinatorial optimization, signal and image processing, information retrieval and statistical machine learning. Many problems that arise in specific instances — including the key problems of computing marginals and modes
Virtual Time and Global States of Distributed Systems
 PARALLEL AND DISTRIBUTED ALGORITHMS
, 1988
"... A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized "real world" and helps to solve problems like getting a consiste ..."
Abstract

Cited by 741 (6 self)
 Add to MetaCart
state problem. Finally, we present a new algorithm to compute a consistent global snapshot of a distributed system where messages may bereceived out of order.
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
Systematic design of program analysis frameworks
 In 6th POPL
, 1979
"... Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant ..."
Abstract

Cited by 771 (52 self)
 Add to MetaCart
Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant
A Framework for Comparing Models of Computation
 IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems
, 1998
"... Abstract—We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general terms as sets of possible behaviors. A process is determinate if, given the constraints imposed by the inputs, there are e ..."
Abstract

Cited by 323 (67 self)
 Add to MetaCart
a partially ordered or totally ordered set. Timed models are where the set of tags is totally ordered. Synchronous events share the same tag, and synchronous signals contain events with the same set of tags. Synchronous processes have only synchronous signals as behaviors. Strict causality (in timed
Coverincomparability graphs of posets
, 2008
"... Coverincomparability graphs (CI graphs, for short) are introduced, whose edgeset is the union of edgesets of the incomparability and the cover graph of a poset. Posets whose CI graphs are chordal (resp. distancehereditary, Ptolemaic) are characterized in terms of forbidden isometric subposets, ..."
Abstract
 Add to MetaCart
Coverincomparability graphs (CI graphs, for short) are introduced, whose edgeset is the union of edgesets of the incomparability and the cover graph of a poset. Posets whose CI graphs are chordal (resp. distancehereditary, Ptolemaic) are characterized in terms of forbidden isometric subposets
On the logical definability of certain graph and poset languages
 J. Automata, Languages and Computation
"... We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic secondorder, a natural extension of monoadic secondorder logic), and to be recognizable in an algebraic framework induced by the notion of modular decomposition of a finite graph. More precis ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic secondorder, a natural extension of monoadic secondorder logic), and to be recognizable in an algebraic framework induced by the notion of modular decomposition of a finite graph. More
The Complexity of the Extendibility Problem for Finite Posets
 SIAM J. Discrete Math
, 1992
"... Abstract. For a finite poset P let EXT(P) denote the following decision problem. Given a finite poset Q and a partial map f from Q to P, decide whether f extends to a monotone total map from Q to P. It is easy to see that EXT(P) is in the complexity class NP. In[SIAM J. Comput., 28 (1998), pp. 57–10 ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
–104], Feder and Vardi define the classes of width 1 and of bounded strict width constraint satisfaction problems for finite relational structures. Both classes belong to the broader class of bounded width problems in P. We prove that for any finite poset P, if EXT(P) has bounded strict width, then it has
Results 1  10
of
4,113