Publication

DATASHARENETWORK A Decentralized Privacy-Preserving Search Engine for Investigative Journalists

Related publications (33)

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.

Parallelization of the distinct lattice spring model

Jiannong Fang, Liang Sun, Jian Zhao, Gaofeng Zhao

The distinct lattice spring model (DLSM) is a newly developed numerical tool for modeling rock dynamics problems, i.e. dynamic failure and wave propagation. In this paper, parallelization of DLSM is presented. With the development of parallel computing tec ...

Wiley-Blackwell2013

A method and device for predicting faults in an it system

Dejan Novakovic, Dejan Kostic, Marco Canini, Vojin Jovanovic, Olivier Crameri

A method and device for predicting faults in a distributed heterogeneous IT system (100), the method comprising: creating a local checkpoint (19) in an explorer node (10) of said system (100), said local checkpoint (19) reflecting the state of said explore ...

2012

The Complexity Of Early Deciding Set Agreement

Rachid Guerraoui, Bastian Pochon

In the k-set agreement problem, each processor starts with a private input value and eventually decides on an output value. At most k distinct output values may be chosen, and every processor's output value must be one of the proposed values. We consider a ...

Society for Industrial and Applied Mathematics2011

The complexity of robust atomic storage

Rachid Guerraoui, Marko Vukolic

We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolerating the largest possible number t of Byzantine storage component failures ( ...

ACM Press2011

Failure detectors as type boosters

Rachid Guerraoui

The power of an object type T can be measured as the maximum number n of processes that can solve consensus using only objects of T and registers. This number, denoted cons(T), is called the consensus power of T. This paper addresses the question of the we ...

Springer-Verlag2008

A new parallelized 3D SPH model: resolution of water entry problems ans scalability study

Pierre Maruzewski

The parallelized model is first presented and a scalability study is achieved. For computational time saving and memory requirement reasons, the implementation of a three dimensional SPH code implies the need for its parallelization, in order to make possi ...

2008

ProtoPeer: from Simulation to Live Deployment in One Step

Karl Aberer, Wojciech Galuba, Zoran Despotovic

We present ProtoPeer, a peer-to-peer systems prototyping toolkit that allows for switching between the event driven simulation and live network deployment without changing any of the application code. ProtoPeer exports a set of APIs for message passing, me ...

2008

FRODO: A FRamework for Open/Distributed constraint Optimization

Adrian Petcu

We present a framework for distributed combinatorial optimization. The framework is implemented in Java, and simulates a multiagent environment in a single Java virtual machine. Each agent in the environment is executed asynchronously in a separate executi ...

2006

Method to Filter Electronic Messages in A Message Processing System

Jean-Yves Le Boudec, Slavisa Sarafijanovic

The present invention proposes a method to filter electronic messages in a message processing system, this message processing system comprising a temporary memory for storing the received messages intended to users, a first database dedicated to a specific ...

2006

JMSGroups

Arnas Kupsys

Nowadays, computers are the indispensable part of our life. They evolve rapidly and are more and more versatile. Computer networks made the remote corners of the world just a click away. But unavoidably, any software and hardware component is subject to fa ...

EPFL2005