1161 search results - page 109 / 233 » Kinetic Dependence Graphs |
144
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
183
click to vote
PROCEDIA
2010
15 years 4 months ago
2010
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
172
click to vote
FOCS
2009
IEEE
16 years 14 days ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
169
click to vote
IPPS
2009
IEEE
16 years 11 days ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
159
click to vote
DSN
2005
IEEE
15 years 11 months ago
2005
IEEE
Distributed systems with multiple interacting services, such as distributed e-commerce systems, are suitable targets for malicious attacks because of the potential financial impac...