A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain
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.
Constraint-based diagnosis algorithms for multiprocessors A. Petri, P. Urban, J. Altmann, M. Dal Cin, E. Selenyi, K. Tilly, A. Pataricza In the latest years, new ideas appeared in system level diagnosis of multiprocessor systems. In contrary to the traditi ...
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 give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. For the case wh ...
We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the c ...
We present a theory of fast and perfect detector components that extends the theory of detectors and correctors of Arora and Kulkarni, and based on which, we develop an algorithm that automatically transforms a fault-intolerant program into a fail-safe fau ...
We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discrete-time random process. As a result, we obtain a simple criterion involving the fractio ...
Institute of Electrical and Electronics Engineers2001
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 ...
Super-resolution algorithms reconstruct a high resolution image from a set of low resolution images of a scene. Precise alignment of the input images is an essential part of such algorithms. If the low resolution images are undersampled and have aliasing a ...
The past few years have witnessed exciting discoveries in different areas of coding theory and computational number theory. The present monograph, which exhibits the author's "Habilitationsschrift," is a collection of five different topics dealing with the ...
Graph theory experienced a remarkable increase of interest among the scientific community during the last decades. The vertex coloring problem (Min Coloring) deserves a particular attention rince it has been able to capture a wide variety of applications. ...
