19866 search results - page 10 / 3974 » Computing all factorizations in *** |
STACS
2001
Springer
15 years 4 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
SIAMDM
2010
14 years 10 months ago
2010
Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...
GI
2009
Springer
14 years 9 months ago
2009
Springer
Abstract: Modern telecommunications companies currently undergo remarkable structural changes to be successful in the Next-Generation markets for communications and content product...
101
click to vote
SPRINGSIM
2010
14 years 10 months ago
2010
This paper presents a distributed Bayesian fault diagnosis scheme for physical systems. Our diagnoser design is based on a procedure for factoring the global system bond graph (BG...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...