Results 51 to 60 of about 29,958 (160)
All Near Neighbor GraphWithout Searching
Journal of Computer Science and Technology, 2018 Given a collection of n objects equipped with a distance function d(·, ·), the Nearest Neighbor Graph (NNG) consists in finding the nearest neighbor of each object in the collection. Without an index the total cost of NNG is quadratic. Using an index the
Edgar Chávez +3 more
doaj +1 more source
Accounting for boundary effects in nearest-neighbor searching [PDF]
Discrete & Computational Geometry, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arya, Sunil, Mount, DM, Narayan, O.
openaire +5 more sources
yaImpute: An R Package for kNN Imputation
Journal of Statistical Software, 2007 This article introduces yaImpute, an R package for nearest neighbor search and imputation. Although nearest neighbor imputation is used in a host of disciplines, the methods implemented in the yaImpute package are tailored to imputation-based forest ...
Andrew O. Finley, Nicholas L. Crookston
doaj
JuTISI (Jurnal Teknik Informatika dan Sistem Informasi), 2019 E-marketplace has gained popularity with the Indonesian society resulting in the increment of products offered. Consequently, customers require more effort to search for products. In this study, we classified products from several e-marketplaces.
Danny Sebastian
doaj +1 more source
Comparison Based Nearest Neighbor Search
, 2017 We consider machine learning in a comparison-based setting where we are given a set of points in a metric space, but we have no access to the actual distances between the points. Instead, we can only ask an oracle whether the distance between two points $i$ and $j$ is smaller than the distance between the points $i$ and $k$.
Haghiri, Siavash +2 more
openaire +2 more sources
Spectral Approaches to Nearest Neighbor Search [PDF]
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014 Accepted in the proceedings of FOCS 2014.
Abdullah, Amirali +3 more
openaire +2 more sources
Beam-Sweeping Design Based on Nearest Users Position and Beam in 5G mmWave Networks
IEEE Access, 2020 The beam sweeping procedure estimates the beamforming directions, or beams, to be used for downlink millimeter-wave cellular transmissions to an incoming user entering the cell.
Stefano Tomasin +3 more
doaj +1 more source
Active Search for Nearest Neighbors
, 2019 In pattern recognition or machine learning, it is a very fundamental task to find nearest neighbors of a given point. All the methods for the task work basically by comparing the given point to all the points in the data set. That is why the computational cost increases with the number of data points. However, the human visual system seems to work in a
Um, Hayoung, Choi, Heeyoul
openaire +2 more sources
Fast k nearest neighbor search using GPU
2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2008 The recent improvements of graphics processing units (GPU) offer to the computer vision community a powerful processing platform. Indeed, a lot of highly-parallelizable computer vision problems can be significantly accelerated using GPU architecture. Among these algorithms, the k nearest neighbor search (KNN) is a well-known problem linked with many ...
Garcia, Vincent +2 more
openaire +3 more sources
OPRCP: approximate nearest neighbor binary search algorithm for hybrid data over WMSN blockchain
EURASIP Journal on Wireless Communications and Networking, 2018 In order to prevent sensitive data tampering in the application of security monitoring, intelligent traffic, and other sensitive Internet of Things, the research on WMSN (wireless multimedia sensor networks) application system based on blockchain and ...
Huakun Liu +5 more
doaj +1 more source