Sciweavers

1188 search results - page 57 / 238
» Extended Graph Unification
Sort
View
110
Voted
SIMULATION
2008
139views more  SIMULATION 2008»
15 years 21 days ago
Constitutive Hybrid Processes: a Process-Algebraic Semantics for Hybrid Bond Graphs
Models of physical systems have to be based on physical principles such as conservation of energy and continuity of power. These principles are inherently enforced by the bond gra...
Pieter J. L. Cuijpers, Jan F. Broenink, Pieter J. ...
PVLDB
2010
152views more  PVLDB 2010»
14 years 11 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
118
Voted
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
14 years 11 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
14 years 7 months ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan
89
Voted
IJCNN
2008
IEEE
15 years 7 months ago
On the sample mean of graphs
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...
Brijnesh J. Jain, Klaus Obermayer