Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Nacho Valladares"'
Publikováno v:
© Journal of Parallel and Distributed Computing, 2017, vol. 104, p. 167-178
Articles publicats (D-IMAE)
Fort, Marta Sellarès i Chiva, Joan Antoni Valladares Cereceda, Ignacio 2017 Intersecting two families of sets on the GPU Journal of Parallel and Distributed Computing 104 167 178
DUGiDocs – Universitat de Girona
instname
Articles publicats (D-IMAE)
Fort, Marta Sellarès i Chiva, Joan Antoni Valladares Cereceda, Ignacio 2017 Intersecting two families of sets on the GPU Journal of Parallel and Distributed Computing 104 167 178
DUGiDocs – Universitat de Girona
instname
The computation of the intersection family of two large families of unsorted sets is an interesting problem from the mathematical point of view which also appears as a subproblem in decision making applications related to market research or temporal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed8a2422cefb0345a5105adf8b04701f
https://doi.org/10.1016/j.jpdc.2017.01.026
https://doi.org/10.1016/j.jpdc.2017.01.026
Publikováno v:
© Knowledge-Based Systems, 2020, vol. 192, art.núm. 105299
Articles publicats (D-IMAE)
Fort, Marta Sellarès i Chiva, Joan Antoni Valladares, Nacho 2020 Nearest and farthest spatial skyline queries under multiplicative weighted Euclidean distances Knowledge-Based Systems 192 art.núm. 105299
DUGiDocs – Universitat de Girona
instname
Articles publicats (D-IMAE)
Fort, Marta Sellarès i Chiva, Joan Antoni Valladares, Nacho 2020 Nearest and farthest spatial skyline queries under multiplicative weighted Euclidean distances Knowledge-Based Systems 192 art.núm. 105299
DUGiDocs – Universitat de Girona
instname
Consider two point sets in the plane, a set of points of interest and a set of query points that is used to establish distance restrictions with respect to the set of points of interest. A nearest/farthest spatial skyline query retrieves the subset o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d17a458b54b7e79fda1cb02694ac347
http://hdl.handle.net/10256/21577
http://hdl.handle.net/10256/21577
Publikováno v:
© International Journal of Geographical Information Science, 2014, vol. 28, núm. 9, p. 1877-1903
Articles publicats (D-IMA)
DUGiDocs – Universitat de Girona
instname
Articles publicats (D-IMA)
DUGiDocs – Universitat de Girona
instname
Data analysis and knowledge discovery in trajectory databases is an emerging field with a growing number of applications such as managing traffic, planning tourism infrastructures or better understanding wildlife. In this paper, we study the problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b234c25988705d034ea8e8972d96ca19
https://doi.org/10.1080/13658816.2014.902949
https://doi.org/10.1080/13658816.2014.902949
Publikováno v:
© Knowledge and Information Systems, 2014, vol. 40, núm. 2, p. 411-437
Articles publicats (D-IMA)
DUGiDocs – Universitat de Girona
instname
Articles publicats (D-IMA)
DUGiDocs – Universitat de Girona
instname
Data analysis and knowledge discovery in trajectory databases is an emerging field with a growing number of applications such as managing traffic, planning tourism infrastructures, analyzing professional sport matches or better understanding wildlife
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ed365094a1965f48865ff87b467cc01
http://hdl.handle.net/10256/11975
http://hdl.handle.net/10256/11975
Publikováno v:
© Journal of Parallel and Distributed Computing, 2014, vol. 74, núm. 1, p. 1891-1899
Articles publicats (D-IMA)
DUGiDocs – Universitat de Girona
instname
Articles publicats (D-IMA)
DUGiDocs – Universitat de Girona
instname
The extremal sets of a family F of sets consist of all sets of F that are maximal or minimal with respect to the partial order induced by the subset relation in F . In this paper we present efficient parallel GPU-based algorithms, designed under CUDA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e83517e67644f3dadde26d4e487d3831
http://hdl.handle.net/10256/11980
http://hdl.handle.net/10256/11980
Autor:
Nacho Valladares, Joachim Gudmundsson
Publikováno v:
SIGSPATIAL/GIS
Given a trajectory $T$ we study the problem of reporting all subtrajectory clusters of $T$ . To measure similarity between trajectory we choose the Frechet distance. We adapt an existing serial algorithm into a GPU parallel algorithm, resulting in su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55b7ce2b35203feabb937e4861fc544c
https://doi.org/10.1145/2424321.2424355
https://doi.org/10.1145/2424321.2424355
Publikováno v:
ICDM Workshops
Mobile devices provide the availability of tracking and collecting trajectories of moving objects such as vehicles, people or animals. There exists a well-known collection of patterns which can occur for a subset of trajectories. Specifically we stud
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b4d632cd1fc4522526933f54d16afff
https://doi.org/10.1109/icdmw.2010.45
https://doi.org/10.1109/icdmw.2010.45