Pattern matching in doubling spaces
From MaRDI portal
Recommendations
- Geometric pattern matching in d-dimensional space
- Geometric pattern matching in d-dimensional space
- Two-dimensional pattern matching in linear time and small space
- scientific article; zbMATH DE number 2087043
- On matching generalised repetitive patterns
- scientific article; zbMATH DE number 1003305
- Dynamic and approximate pattern matching in 2D
- Multiple matching of parameterized patterns
- Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time
- Fast two-dimensional pattern matching
Cites work
- scientific article; zbMATH DE number 5764857 (Why is no real title available?)
- scientific article; zbMATH DE number 1424291 (Why is no real title available?)
- scientific article; zbMATH DE number 6469222 (Why is no real title available?)
- A PTAS for the Steiner forest problem in doubling metrics
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Bypassing the embedding
- Congruence, similarity, and symmetries of geometric objects
- Distortion Is Fixed Parameter Tractable
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- Geometric pattern matching under Euclidean motion
- Greedy spanners are optimal in doubling metrics
- Hardness of Embedding Metric Spaces of Equal Size
- Introduction to algorithms.
- Local search yields a PTAS for \(k\)-means in doubling metrics
- Low Distortion Maps Between Point Sets
- Metric spaces with expensive distances
- New Doubling Spanners: Better and Simpler
- Parameterized algorithms
- Searching dynamic point sets in spaces with bounded doubling dimension
- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
- Tight lower bounds on graph embedding problems
Cited in
(2)
This page was built for publication: Pattern matching in doubling spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832835)
