Sciweavers

3635 search results - page 188 / 727
» Algorithms for Energy Saving
Sort
View
CVPR
2009
IEEE
16 years 11 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
15 years 2 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
IPPS
2009
IEEE
15 years 11 months ago
Energy minimization for periodic real-time tasks on heterogeneous processing units
Adopting multiple processing units to enhance the computing capability or reduce the power consumption has been widely accepted for designing modern computing systems. Such confi...
Jian-Jia Chen, Andreas Schranzhofer, Lothar Thiele
136
Voted
AICCSA
2005
IEEE
134views Hardware» more  AICCSA 2005»
15 years 10 months ago
Maximum lifetime broadcasting in wireless networks
We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree tha...
J. Park, Salim Sahni
121
Voted
ECCV
2010
Springer
15 years 10 months ago
Converting Level Set Gradients to Shape Gradients
The level set representation of shapes is useful for shape evolution and is widely used for the minimization of energies with respect to shapes. Many algorithms consider energies d...