Sciweavers

2314 search results - page 21 / 463
» Minimal Partitions of a Graph
Sort
View
PKDD
2009
Springer
155views Data Mining» more  PKDD 2009»
14 years 3 months ago
Dynamic Factor Graphs for Time Series Modeling
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...
Piotr W. Mirowski, Yann LeCun
ESOP
2009
Springer
14 years 3 months ago
Minimization Algorithm for Symbolic Bisimilarity
The operational semantics of interactive systems is usually d by labeled transition systems. Abstract semantics is defined in terms of bisimilarity that, in the finite case, can ...
Filippo Bonchi, Ugo Montanari
ISM
2006
IEEE
122views Multimedia» more  ISM 2006»
14 years 2 months ago
SuperGraph Visualization
Given a large social or computer network, how can we visualize it, find patterns, outliers, communities? Although several graph visualization tools exist, they cannot handle larg...
José Fernando Rodrigues Jr., Agma J. M. Tra...
DM
2006
92views more  DM 2006»
13 years 8 months ago
Minimal triangulations of graphs: A survey
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal tr...
Pinar Heggernes
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
13 years 8 months ago
Parking Functions of Types A and B
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
Philippe Biane