Improved Approximation Bounds for Planar Point Pattern Matching

Algorithmica- United States

doi 10.1007/s00453-007-9059-9

Full Text

Abstract

Available in

Categories

Applied Mathematics

Computer Science Applications

Computer Science

Date

October 13, 2007

Authors

Publisher

Springer Science and Business Media LLC

Related search

Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

Performance Evaluation Review

Computer Networks

English

Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

English

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

Advances in Mathematics

English

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

BIT Numerical Mathematics

Computer Networks

Applied Mathematics

Computational Mathematics

English

An Improved QS Algorithm for Pattern Matching of Bit Stream

English

Improved Bounds for Centered Colorings

English

Improved Bounds for Wireless Localization

Lecture Notes in Computer Science

Computer Science

Theoretical Computer Science

English

Resolution Lower Bounds for Perfect Matching Principles

English

Improved Bounds for Stein's Square Functions

Proceedings of the London Mathematical Society

English