Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the max-min fair allocation; in most, but not all cases, they are based on the notion ...
Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily long periods of asynchrony, and yet perform (asymptotically) optimally in well- ...
A fast and exact algorithm is developed for the spin +-2 spherical harmonics transforms on equi-angular pixelizations on the sphere. It is based on the Driscoll and Healy fast scalar spherical harmonics transform. The theoretical exactness of the transform ...
We consider the problem of correlated data gathering by a network with a sink node and a tree based communication structure, where the goal is to minimize the total trans- mission cost of transporting the information collected by the nodes, to the sink nod ...
We present a general framework and an efficient algorithm for tracking relevant video structures. The structures to be tracked are implicitly defined by a Matching Pursuit procedure that extracts and ranks the most important image contours. Based on the ra ...
Recent advances in process synthesis, design, operations, and control have created an increasing demand for efficient numerical algorithms for optimizing a dynamic system coupled with discrete decisions; these problems are termed mixed-integer dynamic opti ...
In some of the recently developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-face ...
The k-distance transformation (k-DT) computes the k nearest patterns from each location on a discrete regular grid within a D dimensional volume, which Warfield [Patt. Rec. Letters, 17(1996) 713-721] proposed to implement using 2^D raster scans. We investi ...
In some of the recently developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-face ...
In many distributed systems, designing an application that maintains consistency and availability despite failure of processes, involves solving some form of agreement. Not surprisingly, providing efficient agreement algorithms is critical for improving th ...
