Publications

This paper presents a collection of approximation formulas that allow a network planner to quickly estimate the size of a mesh optical network with limited inputs.

Summary form only given. The last few years have witnessed a significant increase in the use of databases for complex data analysis (OLAP) applications.

Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams.

© 2018, Springer Science+Business Media, LLC, part of Springer Nature.

We provide a quasi-linear time algorithm for the p-center clustering problem with an additive error less than or equal to 3 times the input graph's hyperbolic constant.

We present a fast algorithm for computing the exact maximum likelihood multi-symbol noncoherent PSK decoder.

Block-based algorithms are considered the fastest approach to label connected components in binary images.

5th Generation (5G) mobile networks are required to support transmission of capacity demanding services such as real-time remote computing without any interruption.

In Internet Protocol TeleVision (IPTV) systems, the use of video compression results in a trade-off between random access and bandwidth consumption.

Poster presentation of two demonstrator concepts which are targeted in public funded project Rf2THzSiSoC.