Published May 18, 2017 | Version v1
Publication

Reporting flock patterns on the GPU

Description

In this paper we study the problem of finding flock patterns in a set of trajectories of moving entities. A flock refers to a large enough subset of entities that move close to each other for a given time interval. We present a parallel approach, to be run on a Graphics Processing Unit, for reporting maximal flocks. We also provide experimental results that show the efficiency and scalability of our approach.

Abstract

Ministerio de Ciencia e Innovación

Additional details

Identifiers

URL
https://idus.us.es/handle/11441/60018
URN
urn:oai:idus.us.es:11441/60018

Origin repository

Origin repository
USE