Sciweavers

1657 search results - page 142 / 332
» Network flow spanners
Sort
View
136
Voted
DAC
1997
ACM
15 years 7 months ago
Power Management Techniques for Control-Flow Intensive Designs
This paper presents a low-overhead controller-based power managementtechnique that re-specifies control signals to reconfigure existing multiplexer networks and functional units t...
Anand Raghunathan, Sujit Dey, Niraj K. Jha, Kazuto...
145
Voted
ICMLA
2007
15 years 4 months ago
Uncertainty optimization for robust dynamic optical flow estimation
We develop an optical flow estimation framework that focuses on motion estimation over time formulated in a Dynamic Bayesian Network. It realizes a spatiotemporal integration of ...
Volker Willert, Marc Toussaint, Julian Eggert, Edg...
104
Voted
APVIS
2003
15 years 4 months ago
The graphical interpretation of plausible tacit knowledge flows
Many organisations make effective use of their codified knowledge, but they often fail to make most efficient use of their tacit knowledge stocks. What we define here as tacit kno...
Peter Busch, Debbie Richards, Christopher N. G. Da...
121
Voted
IPCO
1998
87views Optimization» more  IPCO 1998»
15 years 4 months ago
Simple Generalized Maximum Flow Algorithms
We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms fo...
Éva Tardos, Kevin D. Wayne
SIAMCOMP
1998
176views more  SIAMCOMP 1998»
15 years 3 months ago
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
Yonatan Aumann, Yuval Rabani