446 search results - page 45 / 90 » A fast algorithm for computing steiner edge connectivity |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
A mixed potential integral equation (MPIE) technique combined with fast multi-layer Green’s functions and Gaussian Jacobi high order techniques is used to compute the 3-D freque...
SIGCOMM
2012
ACM
11 years 10 months ago
2012
ACM
We consider a system of compute and storage resources geographically distributed over a large number of locations connected via a wide-area network. By distributing the resources,...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, ...