A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
Shlomo Zilberstein, Abdel-Illah Mouaddib, Andrew A...
The asymptotic convergence of parameterized variants of Newton's method for the solution of nonlinear systems of equations is considered. The original system is perturbed by a...
Nicholas I. M. Gould, Dominique Orban, Annick Sart...