94 search results - page 11 / 19 » Capacity inverse minimum cost flow problem |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
ICCAD
2000
IEEE
13 years 12 months ago
2000
IEEE
— Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral l...
31
Voted
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We propose a framework that performs action recognition and identity maintenance of multiple targets simultaneously. Instead of first establishing tracks using an appearance mode...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— With the growth of mobile users and the increasing deployment of wireless access network infrastructures, the issue of quality of service is becoming an important component of ...
SIAMSC
2008
13 years 7 months ago
2008
We develop a computational method for simulating models of gel dynamics where the gel is described by two phases, a networked polymer and a fluid solvent. The models consist of tra...