On competitive algorithms for approximations of top-k-position monitoring of distributed streams

A Mäcker, M Malatyali… - 2016 IEEE International …, 2016 - ieeexplore.ieee.org
Consider the continuous distributed monitoring model in which n distributed nodes,
receiving individual data streams, are connected to a designated server. The server is asked …

Low-power distributed data flow anomaly-monitoring technology for industrial internet of things

W Han, Z Tian, W Shi, Z Huang, S Li - Sensors, 2019 - mdpi.com
In recent years, the industrial use of the internet of things (IoT) has been constantly growing
and is now widespread. Wireless sensor networks (WSNs) are a fundamental technology …

Monitoring of domain-related problems in distributed data streams

P Bemmann, F Biermeier, J Bürmann, A Kemper… - … Colloquium on Structural …, 2017 - Springer
Consider a network in which n distributed nodes are connected to a single server. Each
node continuously observes a data stream consisting of one value per discrete time step …

A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries

F Biermeier, B Feldkord, M Malatyali… - … and Online Algorithms …, 2018 - Springer
We consider the scenario of n sensor nodes observing streams of data. The nodes are
connected to a central server whose task it is to compute some function over all data items …

A Dynamic Distributed Data Structure for Top-k and k-Select Queries

B Feldkord, M Malatyali… - … on the Occasion of His 60th …, 2018 - Springer
We consider a scenario where n sensor nodes observe streams of data. The nodes are
connected to a central server whose task it is to compute some function over all data items …

[PDF][PDF] Distributed Data Streams

J Castenow, B Feldkord, J Hanselle… - Algorithms for Big …, 2023 - library.oapen.org
We consider a scenario where a server is wirelessly connected to countless sensor nodes
that continuously measure data. The task of the server is to monitor the sensors' data. More …

DFG Priority Programme SPP 1736: Algorithms for Big Data

M Behdju, U Meyer - KI-Künstliche Intelligenz, 2018 - Springer
Abstract Volume, Velocity, and Variety are the three V s commonly used to define the term
big data. Simply put, those refer to the increasing amount of new data created, the …

Programming for open platforms at universities: Experience of joint activity of Petrozavodsk state university and Nokia university cooperation program

YA Bogoyavlenskiy, AV Voronin… - 2009 5th Central and …, 2009 - ieeexplore.ieee.org
In this paper, we show that Russian state educational standards “Applied Mathematics and
Computer Science” and “Information Systems and Technology” are appropriate for teaching …

and Friedhelm Meyer auf der Heide Computer Science Department, Heinz Nixdorf Institute, Paderborn University, Paderborn, Germany {felixbm, bjoernf, malatya …

F Biermeier, B Feldkord… - Approximation and Online …, 2018 - books.google.com
We consider the scenario of n sensor nodes observing streams of data. The nodes are
connected to a central server whose task it is to compute some function over all data items …

[引用][C] Big data: sublinear algorithms for distributed data streams

M Malatyali - 2019 - University of Paderborn, Germany