Publication

The CORBA object group service

Related publications (100)

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.

CAT(0) Geometry for the Thompson Group

Dan Titus Salajan

We investigate Farley’s CAT(0) cubical model for Thompson’s group F (we adopt the classical language of F, using binary trees and piecewise linear maps, avoiding the one of diagram groups and pictures). Main results include: in general, Thompson’s group el ...

EPFL2012

Hot or Not: Interactive Content Search Using Comparisons

Amin Karbasi

In comparison-based active learning, a user searching for a target object navigates through a database in the following manner. The user is asked to select the object most similar to her target from small list of objects. A new object list is then presente ...

2012

“Evolver-Entrée Alpine. Panoramic Structure.”

This striking inhabitable sculpture was erected for the Zermatt Chamber Music Festival. As an architectural artifact, the project intervenes spatially against the pristine panoramic backdrop. In an effort to capitalize on the site's extensive and impressiv ...

Gestalten2012

“Evolver.”

Evolver is a sculpture erected for the Zermatt Festival, an annual chamber music event featuring the Berlin Philharmonic. As an architectural artifact, Evolver intervenes spatially on the panorama surrounding Zermatt. To take full advantage of the views, t ...

The Monacelli Press2012

Model Checking of Distributed Algorithm Implementations

Maysam Yabandeh

It is notoriously difficult to develop reliable, high-performance distributed systems that run over asynchronous networks. Even if a distributed system is based on a well-understood distributed algorithm, its implementation can contain errors arising from ...

EPFL2011

Verification of consensus algorithms using satisfiability solving

André Schiper

Consensus is at the heart of fault-tolerant distributed computing systems. Much research has been devoted to developing algorithms for this particular problem. This paper presents a semi-automatic verification approach for asynchronous consensus algorithms ...

Springer Verlag2011

Compositional timing analysis: power plant protection system case study

Simon Bliudze

We introduce a method for studying temporal behaviour of the so-called Globally Asynchronous, Locally Synchronous (GALS) systems, that is systems consisting of synchronous computing elements communicating over asynchronous channels. Our method is based on ...

ACM2011

Online Testing of Federated and Heterogeneous Distributed Systems

Dejan Novakovic, Dejan Kostic, Marco Canini, Vojin Jovanovic

DiCE is a system for online testing of federated and heterogeneous distributed systems. We have built a prototype of DiCE and integrated it with a BGP router. DiCE quickly detects three important classes of faults, resulting from configuration mistakes, po ...

2011

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

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

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

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

Gossip, also known as epidemic dissemination, is becoming an in- creasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural ex- tension of the random phone-call ...

Springer2010