The causal ordering abstraction and a simple way to implement it
Related publications (87)
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.
In this paper, we analyze applicability of F0 and cepstral features, namely LPCCs, MFCCs, PLPs for robust Automatic Gender Recognition (AGR). Through gender recognition studies on BANCA corpus comprising datasets of varying complexity, we show that use of ...
In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first treat the case of antidirected paths in 5-chromatic digraphs, where we explain El-Sahili’s theorem and provide an elementary and shorter proof of it. We then tr ...
Let T be a triangulated surface given by the list of vertex-triples of its triangles, called rooms. A room-partitioning of T is a subset R of the rooms such that each vertex of T is in exactly one room in R. We prove that if T has a room-partitioning R, th ...
Recently, Byrka, Grandoni, RothvoBand Sanita gave a 1.39 approximation for the Steiner tree problem, using a hypergraph-based linear programming relaxation. They also upper-bounded its integrality gap by 1.55. We describe a shorter proof of the same integr ...
Dynamic optimization provides a unified framework for improving process operations while taking operational constraints into account. In the presence of uncertainty, measurements can be incorporated into the optimization framework for tracking the optimum. ...
We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of a shape, in a scale-adaptive manner. Here a shape O is any bounded open subs ...
The ALICE experiment at CERN LHC is intensively using a PROOF cluster for fast analysis and reconstruction. The current system (CAF - CERN Analysis Facility) consists of 120 CPU cores and about 45 TB of local space. PROOF enables interactive parallel proce ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009
Composability and deadlock-freedom are important properties that are stated for transactional memory (TM). Commonly, the Semantics of TM requires linearization of transactions. It turns out that linearization of transactions that have cyclic communication ...
In this paper, we give a characterization of the rate region for the degraded two message set problem, applied to a combination network with erasure channels. We also provide an algorithm that uses topological information in order to deliver the two messag ...
The algorithm based on nonlinear optimisation as presented in this paper is applicable to the control of complex processes. The systematic approach is doing without the formulation of rules. In case of competing control targets a weighting in the sense of ...
