Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...
In this paper, we propose a Bayesian Pursuit algorithm for sparse representation. It uses both the simplicity of the pursuit algorithms and optimal Bayesian framework to determine...
Hadi Zayyani, Massoud Babaie-Zadeh, Christian Jutt...
Abstract—This paper proposes a novel discrete time secondorder distributed consensus time synchronization (SO-DCTS) algorithm for wireless sensor networks. The consensus properti...
— This paper presents a new updating algorithm to reduce the complexity of computing an observability index for kinematic calibration of robots. An active calibration algorithm i...
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...