Publication

Monotonic Prefix Consistency in Distributed Systems

Related publications (48)

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.

The histone chaperone SET/TAF-Ibeta interacts functionally with the CREB-binding protein

Georgios Sflomos

he oncoprotein SET/TAF-Ibeta is a histone chaperone which is involved in cell-cycle control and chromatin remodeling. Confocal laser scanning microscopy reveals that SET is localized in distinct foci of variable size throughout the nucleoplasm of interphas ...

Elsevier2005

From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement

Rachid Guerraoui, Bastian Pochon

Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This is because the topological questions that underly set agreement are not about ...

2004

Calibration of Spectral Reaction Data

Dominique Bonvin, Michael Amrhein

Calibration is the first step in the prediction of concentrations from spectral measurements of chemical reaction systems. It is a well-known fact that the species in the calibration set must include those in the new set. Typically, the calibration set is ...

1999

Modeling human bodies from video sequences

Daniel Thalmann, Pascal Fua, Ralf Plänkers

In this paper, we show that, given video sequences of a moving person acquired with a multi-camera system, we can track joint locations during the movement and recover shape information. We outline techniques for fitting a simplified model to the noisy 3-D ...

SPIE-Int. Soc. Opt. Eng1998

On the Decomposition of Polychotomies into Dichotomies

Many important classification problems are emphpolychotomies, emphi.e. the data are organized into

K

classes with

K>2

. Given an unknown function

F : Omega to {1, dots, K}

representing a polychotomy, an algorithm aimed at ``learning'' this polychotomy ...

Morgan Kaufmann1997

Coulomb correlation and band gap renormalization at high carrier densities in quantum wires

Elyahou Kapon, Benoît Marie Joseph Deveaud, Daniel Oberli

We have studied the luminescence of narrow quantum wires at photoexcitation densities of up to similar to 3 x 10(6) cm(-1). We show that even at these densities, which are well above the expected Mott density of 8 x 10(5) cm(-1), excitonic recombination do ...

1997

Encapsulation de la Duplication dans le Service N2M

A well accepted technique to ensure reliability in a distributed system is to replicate every object which performs critical processing. However, it is not easy to achieve replication, i.e to enable a replicated object to communicate with other objects, ju ...

1997

On the Decomposition of Polychotomies into Dichotomies

Many important classification problems are \emph{polychotomies}, \emph{i.e.} the data are organized into

K

classes with

K>2

. Given an unknown function

F : Ømega \to \{1, \dots, K\}

representing a polychotomy, an algorithm aimed at ``learning'' this p ...

IDIAP1996

On the Decomposition of Polychotomies into Dichotomies

Many important classification problems are emphpolychotomies, emphi.e. the data are organized into

K

classes with

K>2

. Given an unknown function

F : Omega to {1, dots, K}

representing a polychotomy, an algorithm aimed at ``learning'' this polychotomy ...

Morgan Kaufmann1997

On the Decomposition of Polychotomies into Dichotomies

Many important classification problems are \emph{polychotomies}, \emph{i.e.} the data are organized into

K

classes with

K>2

. Given an unknown function

F : Ømega \to \{1, \dots, K\}

representing a polychotomy, an algorithm aimed at ``learning'' this p ...

IDIAP1996