Publication

Range queries in trie-structured overlays

Related publications (52)

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.

Parallelizing Query Optimization on Shared-Nothing Architectures

Christoph Koch, Immanuel Trummer

Data processing systems offer an ever increasing degree of parallelism on the levels of cores, CPUs, and processing nodes. Query optimization must exploit high degrees of parallelism in order not to gradually become the bottleneck of query evaluation. We s ...

Assoc Computing Machinery2016

SHAPE: Linear-Time Camera Pose Estimation With Quadratic Error-Decay

Martin Vetterli, Adam James Scholefield, Alireza Ghasemi

We propose a novel camera pose estimation or perspective-n-point (PnP) algorithm, based on the idea of consistency regions and half-space intersections. Our algorithm has linear time-complexity and a squared reconstruction error that decreases at least qua ...

Ieee2016

Artist-Oriented 3D Character Posing from 2D Strokes

Ronan Boulic, Benoît Le Callennec, Mentar Mahmudi, Pawan Kumar Harish

In this paper we present an intuitive tool suitable for 2D artists using touch-enabled pen tablets. An artist-oriented tool should be easy-to-use, real-time, versatile, and locally refinable. Our approach uses an interactive system for 3D character posing ...

Elsevier2016

A Thrifty Universal Construction

Rachid Guerraoui, Cheng Wang

A universal construction is an algorithm which transforms any sequential implementation of an object into a concurrent implementation of that same object in a linearizable and wait-free manner. Such constructions require underlying low-level universal shar ...

2015

Distributed Policy Evaluation Under Multiple Behavior Strategies

Ali H. Sayed

We apply diffusion strategies to develop a fully-distributed cooperative reinforcement learning algorithm in which agents in a network communicate only with their immediate neighbors to improve predictions about their environment. The algorithm can also be ...

IEEE2015

Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity

Cheng Wang

Given a system with

n > 3t + 1

processes, where

t

is the tolerated number of faulty ones, we present a fast asynchronous Byzantine agreement protocol that can reach agreement in

O(t)

expected running time. This improves the

O(n^2)

expected running ...

2015

Paris (Monde) : géographies du 13 novembre 2015

Jacques Lévy

The 13th November 2015 terrorist attacks in Paris call for a multi-scalar and multimetric geographical analysis. From Paris’ « intimate hypercentre » to the « global low-intensity civil war », this event embraces the entire complexity of the present contem ...

2015

An Incremental Anytime Algorithm for Multi-Objective Query Optimization

Christoph Koch, Immanuel Trummer

Query plans offer diverse tradeoffs between conflicting cost metrics such as execution time, energy consumption, or execution fees in a multi-objective scenario. It is convenient for users to choose the desired cost tradeoff in an interactive process, dyna ...

2015

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Boi Faltings, Immanuel Trummer

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal. We consider multiple QoS attributes such as response time, cost, and reliability. A s ...

Institute of Electrical and Electronics Engineers2014

Tight Bounds for Asynchronous Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual ...

Association for Computing Machinery2014

Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity

Cheng Wang

Given a system with

n > 3t + 1

processes, where

t

is the tolerated number of faulty ones, we present a fast asynchronous Byzantine agreement protocol that can reach agreement in

O(t)

expected running time. This improves the

O(n^2)

expected running ...

2015