Publications associées à Fully dynamic biconnectivity and transitive closure

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.

Collision-Free Pattern Formation

Rachid Guerraoui, Alexandre David Olivier Maurer

Shoals of small fishes can change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. In this paper, we study the analog problem of distributed pattern formation. A set of processes needs to move ...

2016

Observations on the LPN Solving Algorithm from Eurocrypt'16

Serge Vaudenay, Sonia Mihaela Bogos

In this note we re-evaluate the Eurocrypt’16 paper by Zhang et al. [9] in the area of LPN solving algorithms. We present the history of LPN solving algorithms and give the general description of the algorithm from [9]. While this new algorithm claims to im ...

2016

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Adaptation and Awareness in Robot Ensembles: Scenarios and Algorithms

Francesco Mondada, Michael Bonani

This chapter presents a disaster recovery scenario that has been used throughout the ASCENS project as a reference to coordinate the study of distributed algorithms for robot ensembles. We first introduce the main traits and open problems in the design of ...

Springer2015

What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid

Volkan Cevher, Yen-Huan Li

We design a sublinear Fourier sampling algorithm for a case of sparse off-grid frequency recovery. These are signals with the form ; i.e., exponential polynomials with a noise term. The frequencies satisfy and for some . We design a sublinear time randomiz ...

Springer Verlag2015

Centrality of Trees for Capacitated k-Center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) k locations (called centers) and assign e ...

Springer2014

Seam Carving for Text Line Extraction on Color and Grayscale Historical Manuscripts

Sabine Süsstrunk, Nikolaos Arvanitopoulos Darginis

We propose a novel algorithm for automatic text line extraction on color and grayscale manuscript pages without prior binarization. Our algorithm is based on seam carving to compute separating seams between text lines. Seam carving is likely to produce ...

2014

Right-Protected Data Publishing with Provable Distance-Based Mining

Michail Vlachos, Nikolaos Freris

Protection of one's intellectual property is a topic with important technological and legal facets. We provide mechanisms for establishing the ownership of a dataset consisting of multiple objects. The algorithms also preserve important properties of the d ...

Ieee Computer Soc2014

Fully dynamic biconnectivity and transitive closure

Graph Chatbot

Chattez avec Graph Search

Collision-Free Pattern Formation

Observations on the LPN Solving Algorithm from Eurocrypt'16

Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling

Centrality of trees for capacitated -center

Adaptation and Awareness in Robot Ensembles: Scenarios and Algorithms

What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid

Sensing the real world

Centrality of Trees for Capacitated k-Center

Seam Carving for Text Line Extraction on Color and Grayscale Historical Manuscripts

Right-Protected Data Publishing with Provable Distance-Based Mining

Seam Carving for Text Line Extraction on Color and Grayscale Historical Manuscripts

Right-Protected Data Publishing with Provable Distance-Based Mining

What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid

Sensing the real world

Centrality of Trees for Capacitated k-Center

Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling

Centrality of trees for capacitated -center

Collision-Free Pattern Formation

Observations on the LPN Solving Algorithm from Eurocrypt'16

Adaptation and Awareness in Robot Ensembles: Scenarios and Algorithms