First Page | Document Content | |
---|---|---|
![]() Date: 2011-07-12 09:56:56Artificial intelligence Computer vision Vision Dynamic programming Pattern matching Feature detection Robot control Iterative closest point Shape context Conference on Computer Vision and Pattern Recognition Speeded up robust features Approximate string matching | Source URL: www.tnt.uni-hannover.deDownload Document from Source WebsiteFile Size: 2,90 MBShare Document on Facebook |
![]() | Unfailing Haskell: A Static Checker for Pattern Matching Neil Mitchell and Colin Runciman http://www.cs.york.ac.uk/∼ndm , http://www.cs.york.ac.uk/∼colin University of York, UKDocID: 1xVgx - View Document |
![]() | SWiM: Secure Wildcard Pattern Matching From OT Extension Vladimir Kolesnikov1? , Mike Rosulek2 , and Ni Trieu2 1 2DocID: 1vgge - View Document |
![]() | Regulatory sequence analysis Matrix-based pattern matching Jacques van Helden Aix-Marseille Université, FranceDocID: 1v6Pd - View Document |
![]() | LPEG: a new approach to pattern matching Roberto Ierusalimschy PEG: Parsing Expression GrammarsDocID: 1utvV - View Document |
![]() | Analysis of Fundamental Exact and Inexact Pattern Matching Algorithms Jonathan Lee ID#DocID: 1uq9c - View Document |