$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering
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.
This paper addresses the problem of choosing the best streaming policy for distortion optimal multipath video delivery, under delay constraints. The streaming policy consists in a joint selection of the video packets to be transmitted, as well as their sen ...
In this paper, we propose a novel approach for solving the reliable broadcast problem in a probabilistic unreliable model. Our approach consists in first defining the optimality of probabilistic reliable broadcast algorithms and the adaptiveness of algorit ...
In this paper, we propose an algorithm for automated segmentation of midsagittal brain MR images. First, we apply thresholding to obtain binary images. From the binary images, we locate some landmarks. Based on the landmarks and anatomical information, we ...
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 ...
The authors extend the concept of displacement structure to time-variant matrices and use it to efficiently and recursively propagate the Cholesky factor of such matrices. A natural implementation of the algorithm is via a modular triangular array of proce ...
An algorithm for convex parametric QPs is studied. The algorithm explores the parameter space by stepping a sufficiently small distance over the facets of each critical region and thereby identifying the neighboring regions. Some conjectures concerning thi ...
This paper presents a multiagent-system for integrating AL-ICE: a real-life, distributed, large-scale particle physics experiment of the LHC project at CERN. The work is concerned with solving the large-scale coordination problem using a distributed constr ...
Agreement problems, such as consensus, atomic broadcast, and group membership, are central to the implementation of fault-tolerant distributed systems. Despite the diversity of algorithms that have been proposed for solving agreement problems in the past y ...
This paper addresses the problem of broadcasting messages in a reliable and totally ordered manner when processes and channels may crash and recover, or crash and never recover. We present a suite of specifications of reliable and total order broadcast pri ...
A universal construction is an algorithm that transforms any object with a sequential specification into a wait-free and linearizable implementation of that object. This paper presents a novel universal construction algorithm for a message-passing system w ...
