An exhaustive algorithm based on GPU to process a kNN query

Riquelme, Javier A.; Barrientos, Ricardo J.; Hernández-García, Ruber; Navarro, Cristóbal A.

doi:10.1109/sccc51225.2020.9281231

Cited by 4 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It typically uses the assumption of the data feature similarity that the data points can be found near one to another. The new data can be assigned a value based on how similarly the data match the points trained in the training set [ 91 , 92 ]. The advantages of k-NN algorithm can be summarized: Firstly, it is easy to implement and achieve high-accuracy results.…”

Section: Detection In Uwb Positioning Algorithmsmentioning

confidence: 99%

Indoor Positioning System (IPS) Using Ultra-Wide Bandwidth (UWB)—For Industrial Internet of Things (IIoT)

Che

Ahmed

Lazaridis

et al. 2023

Sensors

View full text Add to dashboard Cite

The integration of the physical and digital world has become increasingly important, and location-based services have become the most sought-after application in the field of the Internet of Things (IoT). This paper delves into the current research on ultra-wideband (UWB) indoor positioning systems (IPS). It begins by examining the most common wireless communication-based technologies for IPSs followed by a detailed explanation of UWB. Then, it presents an overview of the unique characteristics of UWB technology and the challenges still faced by the IPS implementation. Finally, the paper evaluates the advantages and limitations of using machine learning algorithms for UWB IPS.

show abstract

Section: Detection In Uwb Positioning Algorithmsmentioning

confidence: 99%

Indoor Positioning System (IPS) Using Ultra-Wide Bandwidth (UWB)—For Industrial Internet of Things (IIoT)

Che

Ahmed

Lazaridis

et al. 2023

Sensors

View full text Add to dashboard Cite

show abstract

“…In [21] , a Brute-Force parallel algorithm to solve k -NN queries on a multi-GPU platform is presented. The proposed method is comprised of two stages, which first is based on pivots using the value of k to reduce the search space, and the second one uses a set of heaps to return the final results.…”

Section: Brute-force Techniquesmentioning

confidence: 99%