Simple Space-Time Trade-Offs for AESA

DOI10.1007/978-3-540-72845-0_18MaRDI QIDQ5432318zbMATH OpenOpenAlexFDO

Authors Karina Figueroa, Kimmo Fredriksson

Publication date 2 January 2008

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72845-0_18

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Speeding up spatial approximation search in metric spaces
• Reducing the overhead of the AESA metric-space nearest neighbour searching algorithm
• On the Least Cost for Proximity Searching in Metric Spaces
• A probabilistic spell for the curse of dimensionality
• scientific article; zbMATH DE number 1559576

Cited in

(1)

• Reducing the overhead of the AESA metric-space nearest neighbour searching algorithm

This page was built for publication: Simple Space-Time Trade-Offs for AESA

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