Counting distance permutations

DOI10.1016/j.jda.2008.09.011zbMath1162.68011OpenAlexW2055575272MaRDI QIDQ1013072

Matthew Skala

Publication date: 16 April 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.09.011

zbMATH Keywords

metric spaceVoronoi diagramnearest neighbourdistance permutation

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15)

Related Items (1)

Counting distance permutations

Uses Software

• SIFT
• LibMetricSpace

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Special issue: Selected papers from the 1st international workshop on similarity search and applications (SISAP 2008), Cancun, Mexico, April 11--12, 2008
• Counting distance permutations
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
• Satisfying general proximity/similarity queries with metric trees
• A note on the metric properties of trees
• On Delaunay oriented matroids for convex distance functions
• On embedding trees into uniformly convex Banach spaces
• A Graph-Theoretic Game and Its Application to the k-Server Problem
• Oriented Matroids
• Chaos in Dynamical Systems
• Advances in Cryptology - EUROCRYPT 2004
• On the Least Cost for Proximity Searching in Metric Spaces

This page was built for publication: Counting distance permutations