Gabriele Capannini

Gabriele Capannini

Auto-generated profile, based on publicly available information

Gabriele Capannini

School of Innovation, Design and Engineering, Mälardalen University, Västerås, Sweden

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 May 2017 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
GCGabriele Capannini
Gabriele Capannini
TLThomas Larsson
Thomas Larsson
We present an improved parallel Sweep and Prune algorithm that solves the dynamic box intersection problem in three dimensions. It scales up to very large datasets, which makes it suitable for broad phase collision detection in complex moving body simulations. Our algorithm gracefully handles high-density scenarios, including challenging clustering behavior, by using a double-axis sweeping approach and a cache-friendly succinct data structure. The algorithm is realized by three parallel stages for sorting, candidate generation, and object pairing. By the use of temporal coherence, our sorting stage runs with close to optimal load balancing. Furthermore, our approach is characterized by a work-division strategy that relies on adaptive partitioning, which leads to almost ideal scalability. In addition, for scenarios that involves intense clustering along several axes simultaneously, we propose an enhancement that increases the context-awareness of the algorithm. By exploiting information gathered along three orthogonal axes, an efficient choice of what range query to perform can be made per object during run-time. Experimental results show high performance for up to millions of objects on modern multi-core CPUs.

1 May 2016 in Computers & Graphics
Verified
Journal Article
Closed access
TLThomas Larsson
Thomas Larsson
GCGabriele Capannini
Gabriele Capannini
LKLinus Källberg
Linus Källberg

18 February 2015 in International Journal on Digital Libraries
Verified
Journal Article
Open access
PDF file
NTNina Tahmasebi
Nina Tahmasebi
LBLars Borin
Lars Borin
GCGabriele Capannini
Gabriele Capannini
DDDevdatt Dubhashi
Devdatt Dubhashi
PEPeter Exner
Peter Exner
Thomas RisseThomas Risse
Thomas Risse
The concept of culturomics was born out of the availability of massive amounts of textual data and the interest to make sense of cultural and language phenomena over time. Thus far however, culturomics has only made use of, and shown the great potential of, statistical methods. In this paper, we present a vision for a knowledge-based culturomics that complements traditional culturomics. We discuss the possibilities and challenges of combining knowledge-based methods with statistical methods and address major challenges that arise due to the nature of the data; diversity of sources, changes in language over time as well as temporal dynamics of information in general. We address all layers needed for knowledge-based culturomics, from natural language processing and relations to summaries and opinions.

1 August 2011
Verified
Conference Paper
Closed access
GCGabriele Capannini
Gabriele Capannini
This paper presents a novel and efficient method to compute one of the simplest and most useful building block for parallel algorithms: the parallel prefix sum operation. Besides its practical relevance, the problem achieves further interest in parallel-computation theory. We firstly describe step-by-step how parallel prefix sum is performed in parallel on GPUs. Next we propose a more efficient technique properly developed for modern graphics processors and alike processors. Our technique is able to perform the computation in such a way that minimizes both memory conflicts and memory usage. Finally we evaluate theoretically and empirically all the considered solutions in terms of efficiency, space complexity, and computational time. In order to properly conduct the theoretical analysis we used a novel computational model proposed by us in a previous work: K-model. Concerning the experiments, the results show that the proposed solution obtains better performance than the existing ones.