Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 1305437

From MaRDI portal
Publication:4252321
Jump to:navigation, search

zbMath0934.68108MaRDI QIDQ4252321

Suresh Venkatasubramanian, Rajeev Motwani, Piotr Indyk

Publication date: 25 April 2000


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

geometric pattern matching


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)


Related Items

Output sensitive algorithms for approximate incidences and their applications ⋮ Two-dimensional pattern matching with rotations ⋮ Constant time approximation scheme for largest well predicted subset ⋮ Two-Dimensional Pattern Matching with Combined Scaling and Rotation ⋮ Improved approximation bounds for planar point pattern matching ⋮ New complexity bounds for image matching under rotation and scaling ⋮ Faster balanced clusterings in high dimension ⋮ Constrained Branch-and-Bound algorithm for image registration ⋮ Unnamed Item ⋮ Learning the truth vector in high dimensions ⋮ New Complexity Bounds for Image Matching under Rotation and Scaling ⋮ A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation ⋮ Approximate congruence in nearly linear time



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4252321&oldid=18146220"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 17:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki