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 2 of 2 for “"High-dimensional index"”.

  1. NV-tree : a scalable disk-based high-dimensional index

    … k- nearest neighbors within large collections of high-dimensional data points. The NV-tree is a very compact index, as only six bytes are kept in the index for each high-dimensional descriptor. It thus scales extremely well when indexing large collections of high-dimensional descriptors. The …

    reykjavik Repository record for NV-tree : a scalable disk-based high-dimensional index (opens in a new tab)

  2. High-dimensional indexing methods utilizing clustering and dimensionality reduction

    … data objects are extracted and transformed into high-dimensional data points. Searching for objects becomes a search on points in the high-dimensional feature space. The dissimilarity between two objects is determined by the distance between two feature vectors. Similarity search is usually …

    njit Repository record for High-dimensional indexing methods utilizing clustering and dimensionality reduction (opens in a new tab)