Counting distance permutations

DOI10.1016/J.JDA.2008.09.011zbMATH Open1162.68011OpenAlexW2055575272MaRDI QIDQ1013072FDOQ1013072

Authors: 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

Recommendations

• On the Least Cost for Proximity Searching in Metric Spaces
• Distance-based index structures for fast similarity search
• scientific article; zbMATH DE number 1559576
• Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.
• scientific article; zbMATH DE number 1754614

zbMATH Keywords

metric spaceVoronoi diagramnearest neighbourdistance permutation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• ENUMERATING INTERDISTANCES IN SPACE
• The minimum Manhattan distance and minimum jump of permutations
• Counting distance permutations
• A review of metrics on permutations for search landscape analysis

Uses Software

• SIFT
• LibMetricSpace

This page was built for publication: Counting distance permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013072)