Výsledky vyhledávání - RK-tree algorithm

  • Zobrazuji výsledky 1 - 9 z 9
Upřesnit hledání
  1. 1

    Optimized rank-based key management for energy-efficient routing in wireless sensor networks for IoT applications Autor Hussain, Muzammil, Hussain, Mudassar, Aamer, Najmuddin, Shaikh, Farhan

    ISSN: 2730-7239, 2730-7239
    Vydáno: Cham Springer International Publishing 01.12.2025
    Vydáno v Discover Internet of things (01.12.2025)
    “… Compared to previous methods, this candidate RK-EFCRP is the first to combine a rank-based dynamic key update protocol with the hierarchy clustering hierarchical structure of the hybrid RK-tree…”
    Získat plný text
    Journal Article
  2. 2

    Prediction of heart disease using apache spark analysing decision trees and gradient boosting algorithm Autor Chugh, Saryu, Arivu Selvan, K, Nadesh, RK

    ISSN: 1757-8981, 1757-899X
    Vydáno: Bristol IOP Publishing 01.11.2017
    “…Numerous destructive things influence the working arrangement of human body as hypertension, smoking, obesity, inappropriate medication taking which causes…”
    Získat plný text
    Journal Article
  3. 3

    RETRACTED: Prediction of heart disease using apache spark analysing decision trees and gradient boosting algorithm Autor Chugh, Saryu, Arivu Selvan, K, Nadesh, RK

    ISSN: 1757-8981, 1757-899X
    Vydáno: 01.11.2017
    “…Numerous destructive things influence the working arrangement of human body as hypertension, smoking, obesity, inappropriate medication taking which causes…”
    Získat plný text
    Journal Article
  4. 4

    A Faster Algorithm for the Inverse Spanning Tree Problem Autor Ahuja, Ravindra K., Orlin, James B.

    ISSN: 0196-6774, 1090-2678
    Vydáno: San Diego, CA Elsevier Inc 01.01.2000
    Vydáno v Journal of algorithms (01.01.2000)
    “…In this paper, we consider the inverse spanning tree problem. Given an undirected graph G0=(N0,A0) with n nodes, m arcs, an arc cost vector c, and a spanning…”
    Získat plný text
    Journal Article
  5. 5

    A multistage logistics system design problem with inventory considering demand change by hybrid genetic algorithm Autor Inoue, Hisaki, Gen, Mitsuo

    ISSN: 1942-9533, 1942-9541
    Vydáno: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.05.2012
    “… These problems can be solved using various methods such as a genetic algorithm (GA), simulated annealing, and tabu search…”
    Získat plný text
    Journal Article
  6. 6

    Distributed algorithms for finding and maintaining a k-tree core in a dynamic network Autor Srivastava, Saurabh, Ghosh, R.K.

    ISSN: 0020-0190, 1872-6119
    Vydáno: Amsterdam Elsevier B.V 30.11.2003
    Vydáno v Information processing letters (30.11.2003)
    “… . In this paper first we propose a distributed algorithm for constructing a rooted spanning tree of a dynamic graph such that root of the tree is located near the center of the graph…”
    Získat plný text
    Journal Article
  7. 7

    Parallel breadth-first search algorithms for trees and graphs Autor Ghosh, Ratan K., Bhattacharjee, G.P.

    ISSN: 0020-7160, 1029-0265
    Vydáno: Abingdon Gordon and Breach Science Publishers 01.01.1984
    “…Parallel Breadth-First Search (BFS) algorithms for ordered trees and graphs on a shared memory model of a Single Instruction-stream Multiple Data-stream computer are proposed…”
    Získat plný text
    Journal Article
  8. 8

    Sorting Algorithms on Manifolds Autor Kohn, Asa

    ISBN: 9798290631202
    Vydáno: ProQuest Dissertations & Theses 01.01.2024
    “… A modification to this algorithm using a k-d tree on some map M → Rk seems likely to run faster in many cases, in particular requiring fewer distance computations…”
    Získat plný text
    Dissertation
  9. 9

    面向不确定文本数据的余弦相似性查询方法 Autor 朱命冬, 徐立新, 申德荣, 寇月, 聂铁铮

    ISSN: 1673-9418
    Vydáno: 东北大学 计算机科学与工程学院,沈阳110819%河南工学院 计算机科学与技术系,河南 新乡,453003%东北大学 计算机科学与工程学院,沈阳,110819 2018
    Vydáno v 计算机科学与探索 (2018)
    “…信息的余弦距离不属于度量空间,难于构建索引.为此主要研究了面向不确定文本数据基于余弦相似度的相似性查询方法.通过分析不确定性余弦相似度计算的特性,提出了快速相似度计算方法.通过对余弦距离的计算进行转换,构建改进的索引结构sMVP-tree(statistic multiple vantage point tree…”
    Získat plný text
    Journal Article