Sciweavers

21 search results - page 1 / 5
» Optimizing energy to minimize errors in dataflow graphs usin...
Sort
View
CASES
2010
ACM
13 years 1 months ago
Optimizing energy to minimize errors in dataflow graphs using approximate adders
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna ...
TC
2008
13 years 4 months ago
Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute in...
Sander Stuijk, Marc Geilen, Twan Basten
EMMCVPR
2001
Springer
13 years 9 months ago
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
Yuri Boykov, Vladimir Kolmogorov
EMMCVPR
2001
Springer
13 years 9 months ago
A Double-Loop Algorithm to Minimize the Bethe Free Energy
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
Alan L. Yuille
LCTRTS
2010
Springer
13 years 11 months ago
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...
Minming Li, Chun Jason Xue, Tiantian Liu, Yingchao...