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...
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 ...
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
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...
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...