English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The Closest Pair Problem consists in finding the closest pair of points in a set of points. The contributions of this work are: (a) the proposal of a new approach, based on spatial partitioning, for the solution of the problem; (b) the development of a sequential solution, based on the new approach, which achieves better performance than solutions based on the traditional divide and conquer approach; (c) the development of a parallel solution for execution in GPU, also based on the new approach, which reaches speedups up to 79.8 and 142.8 (for low and high density of points, respectively), with respect to the best sequential solution; and (d) the proposal of optimizations to improve the performance of the developed solutions.

Paralelização e Otimização em GPU do Problema do Par de Pontos Mais Próximos