Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

XHTML

Related publications (11)

Distributed Transactional Systems Cannot Be Fast

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Jingjing Wang, Panagiota Fatourou

We prove that no fully transactional system can provide fast read transactions (including read-only ones that are considered the most frequent in practice). Specifically, to achieve fast read transactions, the system has to give up support of transactions ...

2019

Fast General Distributed Transactions with Opacity

Aleksandar Dragojevic, Stanko Novakovic, Georgios Chatzopoulos

Transactions can simplify distributed applications by hiding data distribution, concurrency, and failures from the application developer. Ideally the developer would see the abstraction of a single large machine that runs transactions sequentially and neve ...

ASSOC COMPUTING MACHINERY2019

Safety, Liveness and Parallelism in Concurrent Computing

Victor Bushkov

The correctness of a shared object, which can be accessed by several processes concurrently, is specified through two different kinds of properties - safety and liveness. When implementing a shared object it is important to specify its correctness in a suc ...

EPFL2015

Towards a highly effective and robust Web credibility evaluation system

Karl Aberer, Xin Liu

By leveraging crowdsourcing, Web credibility evaluation systems (WCESs) have become a promising tool to assess the credibility of Web content, e.g., Web pages. However, existing systems adopt a passive Way to collect users' credibility ratings, which incur ...

Elsevier Science Bv2015

Scalable and Reactive Programming for Semantic Web Developers

Jean Paul Calbimonte Perez

The Semantic Web brings a powerful set of concepts, standards and ideas that are already changing the shape of the Web. However, in order to put these notions into practice we need to translate them into code. That is why the broad notion of programming th ...

CEUR-WS2015

MARKDOWN

Nicolas Borboën

Français: Markdown est un langage de balisage léger qui permet d’écrire simplement du texte et de le convertir en code HTML pour sa publication sur un site web. Facile à lire, facile à écrire. English: Markdown is a small markup language that allows you to ...

2013

Tag Recommendation for Large-Scale Ontology-Based Information Systems

Karl Aberer, Alexey Boyarsky, Oleg Ruchayskiy, Philippe Cudré-Mauroux, Roman Prokofyev

We tackle the problem of improving the relevance of automatically selected tags in large-scale ontology-based information systems. Contrary to traditional settings where tags can be chosen arbitrarily, we focus on the problem of recommending tags (e.g., co ...

Springer2012

Object-based Tag Propagation for Semi-automatic Annotation of Images

Touradj Ebrahimi, Jong Seok Lee, Lutz Goldmann, Péter Vajda, Ivan Ivanov

Over the last few years, social network systems have greatly increased users’ involvement in online content creation and annotation. Since such systems usually need to deal with a large amount of multimedia data, it becomes desirable to realize an interact ...

2010

Model checking transactional memories

Rachid Guerraoui

Model checking transactional memories (TMs) is difficult because of the unbounded number, length, and delay of concurrent transactions, as well as the unbounded size of the memory. We show that, under certain conditions satisfied by most TMs we know of, th ...

Springer Verlag2010

Completeness and Nondeterminism in Model Checking Transactional Memories

Rachid Guerraoui

Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the first \emph{deterministic} specification automata for strict serializability and ...

Springer2008

Completeness and Nondeterminism in Model Checking Transactional Memories

Rachid Guerraoui

Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the first deterministic specification automata for strict serializability and opacit ...

2008

Related publications (11)

Distributed Transactional Systems Cannot Be Fast

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Jingjing Wang, Panagiota Fatourou

2019

Fast General Distributed Transactions with Opacity

Aleksandar Dragojevic, Stanko Novakovic, Georgios Chatzopoulos

ASSOC COMPUTING MACHINERY2019

Safety, Liveness and Parallelism in Concurrent Computing

Victor Bushkov

EPFL2015

Towards a highly effective and robust Web credibility evaluation system

Karl Aberer, Xin Liu

Elsevier Science Bv2015

Scalable and Reactive Programming for Semantic Web Developers

Jean Paul Calbimonte Perez

CEUR-WS2015

MARKDOWN

Nicolas Borboën

2013

Tag Recommendation for Large-Scale Ontology-Based Information Systems

Karl Aberer, Alexey Boyarsky, Oleg Ruchayskiy, Philippe Cudré-Mauroux, Roman Prokofyev

Springer2012

Object-based Tag Propagation for Semi-automatic Annotation of Images

Touradj Ebrahimi, Jong Seok Lee, Lutz Goldmann, Péter Vajda, Ivan Ivanov

2010

Model checking transactional memories

Rachid Guerraoui

Springer Verlag2010

Completeness and Nondeterminism in Model Checking Transactional Memories

Rachid Guerraoui

Springer2008

Completeness and Nondeterminism in Model Checking Transactional Memories

Rachid Guerraoui

Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the first deterministic specification automata for strict serializability and opacit ...

2008