6 articles for “Nearest Neighbor Search”

Set a search alert

Research ArticleOpen accessPhrase in the titleFINDING A RESIDENCE WITH ALL FACILITIES USING NEAREST NEIGHBOR SEARCHK. Padmapriya, Dr. S. SridharNearest neighbor search is one of the most widely-used techniques and its applications including mobile communication, Geographic information systems, bioinformatics, computer vision and marketing. For example, four friends want to rent an apartment which should be nearer to their working places. Our paper discussed about the problems on finding the most appropriate location among a set of available places. The … …Journal of Computer Science, Vol. 10, Issue 6 · 1 Feb 2014 · 6,803 accessesView PDF Cite

Research ArticleOpen accessPhrase in the titleAn Efficient Bayesian Nearest Neighbor Search Using Marginal Object Weight Ranking Scheme in Spatial DatabasesK. Balasaravanan, K. DuraiswamyProblem statement: A database that is optimized to store and query data that is related to objects in space, including points, lines and polygons is called spatial database. Identifying nearest neighbor object search is a vital part of spatial database. Many nearest neighbor search techniques such as Authenticated Multi-step NN (AMNN), Superseding Nearest Neighbor (SNN) search, Bayesian Nearest Neighbor (BNN) … …Journal of Computer Science, Vol. 8, Issue 8 · 30 Jul 2012 · 7,149 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsSelective Flooding Based on Relevant Nearest-Neighbor using Query Feedback and Similarity across Unstructured Peer-to-Peer NetworksIskandar Ishak, Naomie SalimProblem statement: Efficient searching is a fundamental problem for unstructured peer to peer networks. Flooding requires a lot of resources in the network and thus will increase the search cost. Searching approach that utilizes minimum network resources is required to produce efficient searching in the robust and dynamic peer-to-peer network. Approach: This study addressed the need for efficient flood-based searching … …Journal of Computer Science, Vol. 5, Issue 3 · 31 Mar 2009 · 7,696 accessesView PDF Cite

Research ArticleOpen accessIn the abstractVoronoi Partition to Support Data Search in Uncertain Database with k-Bound FilteringSlamet Sudaryanto Nurhendratno, Sudaryanto, Solichul HudaWith the development of mobile technology, one of its main functions is to have mobile navigation capabilities, this is one of the Location-Based Services (LBS). Mobile navigation is designed as a mobile device to be able to monitor access objects from users. Because of the mobile characteristic, the impact on the points of objects to be found always occur a … …Journal of Computer Science, Vol. 16, Issue 12 · 22 Dec 2020 · 6,645 accessesView PDF Cite

Research ArticleOpen accessIn the abstractSoft Clustering Based Exposition to Multiple Dictionary Bag of WordsK. S. Sujatha, B. VinodObject classification is a highly important area of computer vision and has many applications including robotics, searching images, face recognition, aiding visually impaired people, censoring images and many more. A new common method of classification that uses features is the Bag of Words approach. In this method a codebook of visual words is created using various clustering methods. For increasing … …Journal of Computer Science, Vol. 8, Issue 12 · 20 Dec 2012 · 6,389 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA Gaussian Process Regression Model for the Traveling Salesman ProblemWanatchapong Kongkaew, Juta PichitlamkenProblem statement: Traveling Salesman Problem (TSP) is a famous NP hard problem. Many approaches have been proposed up to date for solving TSP. We consider a TSP tour as a dependent variable and its corresponding distance as an independent variable. If a predictive function can be formulated from arbitrary sample tours, the optimal tour may be predicted from this function. … …Journal of Computer Science, Vol. 8, Issue 10 · 30 Aug 2012 · 7,367 accessesView PDF Cite