Amihood Amir, Oren Kapah, Dekel Tsur  Home/Search
Context
Related
| cs.haifa.ac.il/~dekelts/p...rotation.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.haifa.ac.il/~dekelts/pub...pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The most e#cient currently known algorithms for two dimensional matching with rotation have a worst case time complexity of O(n ), where the size of the text is n and the size of the pattern is m . In this paper we present two algorithms for the two dimensional rotated matching problem whose running time is O(n ). The preprocessing time of the first algorithms is O(m ) and the preprocessing time of the second algorithm is O(m ). (Update)
Active bibliography (related documents): More All
0.9: Rotation and Lighting Invariant Template Matching - Fredriksson, Mäkinen, Navarro (2004) (Correct)
0.7: Sequential and Indexed Two-Dimensional Pattern.. - Fredriksson, Navarro, .. (2003) (Correct)
0.5: Faster Than FFT: Rotation Invariant Combinatorial.. - Fredriksson, Navarro.. (2002) (Correct)
Similar documents based on text: More All
0.3: Efficient Unsupervised Recursive Word Segmentation.. - Argamon, Akiva, Amir.. (2004) (Correct)
0.3: Supporting Collaborative Activity - Hadad, Armon-Kest, Kaminka, Kraus (2005) (Correct)
0.3: Graph Theoretic Models for Reasoning About - Time Martin Charles (Correct)
BibTeX entry: (Update)
@misc{ amir-faster,
author = "Amihood Amir and Oren Kapah and Dekel Tsur",
title = "Faster Two Dimensional Pattern Matching with Rotations",
url = "citeseer.ist.psu.edu/702064.html" }
Citations (may not include all citations):204 Oxford University Press (context) - Crochemore, Rytter - 1994
112 and Sequences: Computer Science and Computational Biology (context) - Gusfield, Strings - 1997
49 Pattern Matching Algorithms (context) - Apostolico, Galil - 1997
23 SIAM-AMS Proceedings (context) - Fischer, Paterson et al. - 1974
14 Combinatorial methods for approximate pattern matching under.. - Fredriksson, Ukkonen - 2000
14 A rotation invariant filter for two-dimensional string match.. - Fredriksson, Ukkonen - 1998
14 A rotation invariant filter for two-dimensional string match.. - Fredriksson, Ukkonen - 1998
13 Fast parallel and serial multidimensional approximate array .. (context) - Amir, Landau - 1991
13 An index for two dimensional string matching allowing rotati.. - Fredriksson, Navarro et al. - 2000
9 Two dimensional dictionary matching - Amir, Farach - 1992
9 Pattern matching in a digitized image - Landau, Vishkin - 1994
6 Two-dimensional pattern matching with rotations (context) - Amir, Butman et al. - 2003
5 Optimal exact and fast approximate two dimensional pattern m.. - Fredriksson, Navarro et al. - 2002
4 cient string matching (context) - Aho, Corasick - 1975
4 the construction of classes of su#x trees for square matrice.. (context) - Giancarlo, Grossi - 1996
3 Rotation and lighting invariant template matching - Fredriksson, Makinen et al. - 2004
3 Information Processing Letters (context) - Amir, Butman et al. - 1999
1 Real two dimensional scaled matching (context) - Amir, Butman et al. - 2003
Documents on the same site (http://cs.haifa.ac.il/~dekelts/publications/pub.html): More
Bounds for Resequencing by Hybridization - Tsur (2003) (Correct)
Cluster Graph Modification Problems - Ron Shamir Roded (2002) (Correct)
Faster Subtree Isomorphism - Shamir, Tsur (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC