Improved Approximation Bounds for Planar Point Pattern Matching

Algorithmica - United States
doi 10.1007/s00453-007-9059-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

Performance Evaluation Review
HardwareComputer NetworksSoftwareArchitectureCommunications
2016English

Explicit Bounds for Rational Points Near Planar Curves and Metric Diophantine Approximation

Advances in Mathematics
Mathematics
2010English

Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

2016English

Improved Error Bounds for Floating-Point Products and Horner’s Scheme

BIT Numerical Mathematics
Computer NetworksApplied MathematicsSoftwareComputational MathematicsCommunications
2015English

An Improved QS Algorithm for Pattern Matching of Bit Stream

2016English

Improved Bounds for Centered Colorings

2020English

Improved Bounds for Wireless Localization

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Resolution Lower Bounds for Perfect Matching Principles

English

Improved Bounds for Stein's Square Functions

Proceedings of the London Mathematical Society
Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy