Publications related to On the complexity of fixed parameter clique and dominating set

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

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

Convex block-sparse linear regression with expanders - provably

Volkan Cevher, Quoc Tran Dinh, Anastasios Kyrillidis, Luca Baldassarre, Bubacarr Bah

Sparse matrices are favorable objects in machine learning and optimization. When such matrices are used, in place of dense ones, the overall complexity requirements in optimization can be significantly reduced in practice, both in terms of space and run-ti ...

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

Integration of an IEEE Std. C37.118 compliant PMU into a real-time simulator

Mario Paolone, Paolo Romano, Marco Pignati

The simulation of Phasor Measurement Units (PMUs) into real-time simulators (RTSs) is typically limited by the complexity of the synchrophasor estimation (SE) algorithm. This is especially true when dealing with distribution network PMUs due to the more de ...

IEEE2015

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

Divesh Aggarwal

We give a randomized 2^{n+o(n)}-time and space algorithm for solving the Shortest Vector Problem (SVP) on n-dimensional Euclidean lattices. This improves on the previous fastest algorithm: the deterministic O(4^n)-time and O(2^n)-space algorithm of Miccian ...

ACM2015

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

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

Unlabeled Sensing

Golnooshsadat Elhami

Like other data sensing problems, in unlabeled sensing, the target is to solve the equation y = Φx by finding vector x given a set of sample values in vector y as well as the matrix Φ. However, the main challenge in unlabeled sensing is that the correct or ...

2015

Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures

Rachid Guerraoui, Vasileios Trigonakis, Tudor Alexandru David

We introduce "asynchronized concurrency (ASCY),'' a paradigm consisting of four complementary programming patterns. ASCY calls for the design of concurrent search data structures (CSDSs) to resemble that of their sequential counterparts. We argue that ASCY ...

2015

On the complexity of fixed parameter clique and dominating set

Graph Chatbot

Chat with Graph Search

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Collision-Free Pattern Formation

Convex block-sparse linear regression with expanders - provably

Observations on the LPN Solving Algorithm from Eurocrypt'16

Integration of an IEEE Std. C37.118 compliant PMU into a real-time simulator

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

An Incremental Anytime Algorithm for Multi-Objective Query Optimization

Adaptation and Awareness in Robot Ensembles: Scenarios and Algorithms

Unlabeled Sensing

Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Adaptation and Awareness in Robot Ensembles: Scenarios and Algorithms

Unlabeled Sensing

An Incremental Anytime Algorithm for Multi-Objective Query Optimization

Collision-Free Pattern Formation

Convex block-sparse linear regression with expanders - provably

Integration of an IEEE Std. C37.118 compliant PMU into a real-time simulator

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

Observations on the LPN Solving Algorithm from Eurocrypt'16

Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures