Exploració per tema "K-d trees"

Ara es mostren els items 1-3 de 3

    • Median and hybrid median K-dimensional trees 

      Duch Brown, Amalia; Martínez Parra, Conrado; Pons, Mercè; Roura Ferret, Salvador (Springer, 2022)
      Article
      Accés obert
      We consider here two new variants of K-dimensional binary search trees (K-d trees): median K-d trees and hybrid-median K-d trees. These two kinds of trees are designed with the aim to get a tree as balanced as possible. ...

    • On the average performance of fixed partial match queries in random relaxed K-d trees 

      Duch Brown, Amalia; Lau Laynes-Lozada, Gustavo Salvador; Martínez Parra, Conrado (2014)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      We obtain an explicit formula for the expected cost of a fixed partial match query in a random relaxed K-d tree, that is, the expected cost for a query of the form q = (q0 , q1 , . . . , qK-1 ) with 0 < s < K specified ...

    • On the expected cost of partial match queries in random Quad-K-d trees 

      Duch Brown, Amalia; Martínez Parra, Conrado (Springer, 2024-03-04)
      Article
      Accés obert
      Quad-K-d trees introduced by Bereckzy et al. (In: Proceedings of the 11th Latin merican Theoretical Informatics Conference (LATIN). Lecture Notes in Computer Science, vol. 8392, pp. 743–754, 2014) are a generalization of ...