Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Dual-tree algorithms"”.

  1. Improving dual-tree algorithms

    … large body of work is entirely centered around dual-tree algorithms, a class of algorithm based on spatial indexing structures that often provide large amounts of acceleration for various problems. This work focuses on understanding dual-tree algorithms using a new, tree-independent abstraction, …

    gatech Repository record for Improving dual-tree algorithms (opens in a new tab)

  2. A Comparative Study of Dual-tree Algorithms for Computing Spatial Distance Histogram

    … DMs that can be plugged in for computation: Quad-tree (Oct-tree for three-dimensional data) and k-d tree data structure. In this thesis paper, by using the geometric method, we prove the unre- solvable ratios on the k-d tree. Further, we analyze and compare the difference in the performance in …

    usf Repository record for A Comparative Study of Dual-tree Algorithms for Computing Spatial Distance Histogram (opens in a new tab)

  3. Multi-tree algorithms for computational statistics and phyiscs

    … by organizing the data in a space-partitioning tree, distant interactions are quickly and efficiently approximated. Similarly, dual-tree algorithms, which approximate or eliminate parts of a computation using distance bounds, are the fastest algorithms for several fundamental problems in …

    gatech Repository record for Multi-tree algorithms for computational statistics and phyiscs (opens in a new tab)