Publications associées à Liste chaînée

List Ordered Statistics Decoders for Polar Codes

Andreas Peter Burg, Yifei Shen, Chuan Zhang

The de-facto standard decoding algorithm for polar codes, successive cancellation list (SCL) decoding, is a breadth-first search algorithm. By keeping a list of candidate codewords, SCL decoding improves the performance as the list size L increases. Howeve ...

IEEE2022

La mémoire collective et l'espace. Traces, récits et expériences autour d'un paysage urbain romain

Lucia Bordone

This PhD thesis explores the way multiple and tenuous links connect collective memory and space in the contemporary city. It does so through a field enquiry carried out in Rome, Italy. This palimpsest-city has a particular relationship to the past, which c ...

EPFL2020

A Catalyst Framework for Minimax Optimization

Negar Kiyavash

We introduce a generic two-loop scheme for smooth minimax optimization with strongly-convex-concave objectives. Our approach applies the accelerated proximal point framework (or Catalyst) to the associated dual problem and takes full advantage of existing ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2020

Log-Free Concurrent Data Structures

Rachid Guerraoui, Aleksandar Dragojevic, Mihail Igor Zablotchi, Tudor Alexandru David

Non-volatile RAM (NVRAM) makes it possible for data structures to tolerate transient failures, assuming however that programmers have designed these structures such that their consistency is preserved upon recovery. Previous ap- proaches are typically tran ...

USENIX Association2018

Log-Free Concurrent Data Structures

Rachid Guerraoui, Aleksandar Dragojevic, Mihail Igor Zablotchi, Tudor Alexandru David

Non-volatile RAM (NVRAM) makes it possible for data structures to tolerate transient failures, assuming however that programmers have designed these structures such that their consistency is preserved upon recovery. Previous approaches are typically transa ...

USENIX ASSOC2018

Elastic transactions

Rachid Guerraoui, Vincent Gramoli, Pascal Felber

This paper presents elastic transactions, an appealing alternative to traditional transactions, in particular to implement search structures in shared memory multicore architectures. Upon conflict detection, an elastic transaction might drop what it did so ...

Academic Press Inc Elsevier Science2017

3D dynamic fragmentation with parallel dynamic insertion of cohesive elements

Jean-François Molinari, Nicolas Richart, Marco Vocialta

Dynamic fragmentation is a rapid and catastrophic failure of a material. During this process, the nucleation, propagation, branching, and coalescence of cracks results in the formation of fragments. The numerical modeling of this phenomenon is challenging ...

Wiley2017

Using Linked Open Data to Bootstrap a Knowledge Base of Classical Texts

Matteo Romanello

We describe a domain-specific knowledge base aimed at supporting the extraction of bibliographic references in the domain of Classics. In particular, we deal with references to canonical works of the Greek and Latin literature by providing a model that rep ...

CEUR2017

Optimistic Concurrency with OPTIK

Rachid Guerraoui, Vasileios Trigonakis

We introduce OPTIK, a new practical design pattern for designing and implementing fast and scalable concurrent data structures. OPTIK relies on the commonly-used technique of version numbers for detecting conflicting concurrent operations. We show how to i ...

ACM Press2016

Meet the Walkers: Accelerating Index Traversals for In-Memory Databases

Babak Falsafi, Boris Robert Grot, Yusuf Onur Koçberber, Javier Picorel Obando, Kevin Lim

The explosive growth in digital data and its growing role in real-time decision support motivate the design of high-performance database management systems (DBMSs). Meanwhile, slowdown in supply voltage scaling has stymied improvements in core performance ...

2013

Shape Refinement through Explicit Heap Analysis

Grégory Théoduloz, Dirk Thilo Beyer, Damien Zufferey

Shape analysis is a promising technique to prove program properties about recursive data structures. The challenge is to automatically determine the data-structure type, and to supply the shape analysis with the necessary information about the data structu ...

Springer2010

Software Verification by Combining Program Analyses of Adjustable Precision

Grégory Théoduloz

In automatic software verification, we have observed a theoretical convergence of model checking and program analysis. In practice, however, model checkers, on one hand, are still mostly concerned with precision, e.g., the removal of spurious counterexampl ...

EPFL2010

Slicing Distributed Systems

Anne-Marie Kermarrec, Vincent Gramoli

Peer-to-peer (P2P) architectures are popular for tasks such as collaborative download, VoIP telephony, and backup. To maximize performance in the face of widely variable storage capacities and bandwidths, such systems typically need to shift work from poor ...

2009

idMesh: graph-based disambiguation of linked data

Karl Aberer, Philippe Cudré-Mauroux, Parisa Haghani, Michael Jost

We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities -- represented by globally identifiable declarative artifacts -- self-organize in a dynamic and probabilistic manner. Our solution has the ...

ACM2009

Full Functional Verification of Linked Data Structures

Viktor Kuncak

We present the first verification of full functional correctness for a range of linked data structure implementations, including mutable lists, trees, graphs, and hash tables. Specifically, we present the use of the Jahob verification system to verify form ...

2008

Decision Procedures for Multisets with Cardinality Constraints

Viktor Kuncak, Ruzica Piskac

Applications in software verification and interactive theorem proving often involve reasoning about sets of objects. Cardinality constraints on such collections also arise in these scenarios. Multisets arise for analogous reasons as sets: abstracting the c ...

Springer2008

Efficient synthesis of cyclic glycolipids analogues

Sandrine Gerber, Gérald Coste

A straightforward approach to macrocyclic structures containing deoxysugar subunits was developed through the functionalization of a bishemiketal. The choice of the length and the nature of the linkers can provide macrocycles with diverse rigidities and po ...

2007

Shear stress and cyclic circumferential stretch, but not pressure, alter connexin43 expression in endothelial cells

Nikolaos Stergiopoulos, Paolo Silacci

Hemodynamic forces play a critical role in atherogenesis, as evidenced by the focal pattern of development of atherosclerotic lesions. Whereas disturbed flow in the branches and curved regions of large arteries is proatherogenic, laminar flow in the straig ...

2006