Concept

Élément de donnée

Publications associées (32)

Cost-efficient and Differentiated Data Availability Guarantees in Data Clouds

Failures of any type are common in current datacenters. As data scales up, its availability becomes more complex, while different availability levels per application or per data item may be required. In this paper, we propose a self- managed key-value stor ...

IEEE2010

Towards unifying diffusion and exemplar-based inpainting

Pierre Vandergheynst, Emmanuel D'Angelo

A novel framework for image inpainting is proposed, relying on graph-based diffusion processes. Depending on the construction of the graph, both flow-based and exemplar-based inpainting methods can be implemented by the same equations, hence providing a un ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

A Multi-Site Campaign To Measure Solar-Like Oscillations In Procyon. Ii. Mode Frequencies

We have analyzed data from a multi-site campaign to observe oscillations in the F5 star Procyon. The data consist of high-precision velocities that we obtained over more than three weeks with 11 telescopes. A new method for adjusting the data weights allow ...

2010

A self-organized, fault-tolerant and scalable replication scheme for cloud storage

Karl Aberer, Nicolas Bonvin

Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while different availability levels per application or per data item may be required. In t ...

ACM2010

The Snakuscule

Michaël Unser, Philippe Thévenaz

Traditional snakes, or active contours, are planar parametric curves. Their parameters are determined by optimizing the weighted sum of three energy terms: one depending on the data (typically on the integral of its gradient under the curve, or on its inte ...

IEEE2006

Optimistic Algorithms for Partial Database Replication

Nicolas Schiper, Rodrigo Malta Schmidt, Fernando Pedone

In this paper, we study the problem of partial database replication. Numerous previous works have investigated database replication, however, most of them focus on full replication. We are here interested in genuine partial replication protocols, which req ...

2006

GosSkip, an Efficient, Fault-Tolerant and Self Organizing Overlay Using Gossip-based Construction and Skip-Lists principles

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Sidath Handurukande

This paper presents GosSkip, a self organizing and fully distributed overlay that provides a scalable support to data storage and retrieval in dynamic environments. The structure of GosSkip, while initially possibly chaotic, eventually matches a perfect se ...

2006

On the interaction of data representation and routing in sensor networks

Martin Vetterli, Razvan Cristescu

We consider data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information, collected by the nodes, to the sink node. This problem requires a joint ...

IEEE2005

Indexing and selection of data items in huge data sets by constructing and accessing tag collections

Roger Hersch, Sébastien Ponce

We present here a new way of indexing and retrieving data in huge datasets having a high dimensionality. The proposed method speeds up the selecting process by replacing scans of the whole data by scans of matching data. It makes use of two levels of catal ...

2002

Concurrency Control for Transactional Drago

Jörg Kienzle

The granularity of concurrency control has a big impact on the performance of transactional systems. Concurrency control granu- larity and data granularity (data size) are usually the same. The e ect of this coupling is that if a coarse granularity is used ...

Springer Verlag2002

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search