Sciweavers

1127 search results - page 139 / 226
» Testing the Expansion of a Graph
Sort
View
CORR
2006
Springer
102views Education» more  CORR 2006»
14 years 10 months ago
Structural Inference of Hierarchies in Networks
One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to f...
Aaron Clauset, Cristopher Moore, M. E. J. Newman
JEA
2008
88views more  JEA 2008»
14 years 9 months ago
Multilevel algorithms for linear ordering problems
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
Ilya Safro, Dorit Ron, Achi Brandt
NJC
2000
99views more  NJC 2000»
14 years 9 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
CCR
1998
96views more  CCR 1998»
14 years 9 months ago
On routes and multicast trees in the Internet
: Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they can...
Jean-Jacques Pansiot, Dominique Grad
IJAR
2010
152views more  IJAR 2010»
14 years 8 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...