Skip to main content

26 Result(s)

within Chapter Remove this filter Conference Paper Remove this filter Amihood Amir Remove this filter Pattern Recognition Remove this filter

previous disabled Page of 2
and

  1. No Access

    Chapter and Conference Paper

    Efficient randomized dictionary matching algorithms

    The standard string matching problem involves finding all occurrences of a single pattern in a single text. While this approach works well in many application areas, there are some domains in which it is more ...

    Amihood Amir, Martin Farach, Yossi Matias in Combinatorial Pattern Matching (1992)

  2. No Access

    Chapter and Conference Paper

    Alphabet independent and dictionary scaled matching

    The rapidly growing need for analysis of digitized images in multimedia systems has lead to a variety of interesting problems in multidimensional pattern matching. One of the problems is that of scaled matchin...

    Amihood Amir, Gruia Calinescu in Combinatorial Pattern Matching (1996)

  3. No Access

    Chapter and Conference Paper

    Efficient special cases of pattern matching with swaps

    Let a text string of n symbols and a pattern string P of m symbols from alphabet Σ be given. A swapped version T′ of T is a length n string derived from T by a series of local swaps, (i.e. t ℓ ...

    Amihood Amir, Gad M. Landau, Moshe Lewenstein… in Combinatorial Pattern Matching (1998)

  4. No Access

    Chapter and Conference Paper

    Two-Dimensional Pattern Matching with Rotations

    The problem of pattern matching with rotation is that of finding all occurrences of a two-dimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such diffe...

    Amihood Amir, Ayelet Butman, Maxime Crochemore… in Combinatorial Pattern Matching (2003)

  5. No Access

    Chapter and Conference Paper

    Faster Two Dimensional Pattern Matching with Rotations

    The most efficient currently known algorithms for two dimensional matching with rotation have a worst case time complexity of O(n 2 m 3), where the s...

    Amihood Amir, Oren Kapah, Dekel Tsur in Combinatorial Pattern Matching (2004)

  6. No Access

    Chapter and Conference Paper

    Approximate Matching in the L 1 Metric

    Approximate matching is one of the fundamental problems in pattern matching, and a ubiquitous problem in real applications. The Hamming distance is a simple and well studied example of appro...

    Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski in Combinatorial Pattern Matching (2005)

  7. No Access

    Chapter and Conference Paper

    Asynchronous Pattern Matching

    This paper introduces a new pattern matching model that has been gaining importance recently, that of Asynchronous Pattern Matching. Traditional pattern matching has assumed the possibility of errors in the data

    Amihood Amir in Combinatorial Pattern Matching (2006)

  8. No Access

    Chapter and Conference Paper

    Faster Two Dimensional Scaled Matching

    The rapidly growing need for analysis of digitized images in multimedia systems has lead to a variety of interesting problems in multidimensional pattern matching. One of the problems is that of scaled matching, ...

    Amihood Amir, Eran Chencinski in Combinatorial Pattern Matching (2006)

  9. No Access

    Chapter and Conference Paper

    Approximate Matching in Weighted Sequences

    Weighted sequences have been recently introduced as a tool to handle a set of sequences that are not identical but have many local similarities. The weighted sequence is a “statistical image” of this set, wher...

    Amihood Amir, Costas Iliopoulos, Oren Kapah, Ely Porat in Combinatorial Pattern Matching (2006)

  10. No Access

    Chapter and Conference Paper

    Property Matching and Weighted Matching

    Pattern Matching with Properties (Property Matching, for short), involves a string matching between the pattern and the text, and the requirement that the text part satisfies some property.

    Amihood Amir, Eran Chencinski, Costas Iliopoulos… in Combinatorial Pattern Matching (2006)

  11. No Access

    Chapter and Conference Paper

    Two-Dimensional Range Minimum Queries

    We consider the two-dimensional Range Minimum Query problem: for a static (m ×n)-matrix of size N = mn which may be preprocessed, answer on-line queries of the form “where is the position of a minimum element in ...

    Amihood Amir, Johannes Fischer, Moshe Lewenstein in Combinatorial Pattern Matching (2007)

  12. No Access

    Chapter and Conference Paper

    Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications

    In this paper a deterministic algorithm for the length reduction problem is presented. This algorithm enables a new tool for performing fast convolution in sparse data. The proposed algorithm performs the conv...

    Amihood Amir, Oren Kapah, Ely Porat in Combinatorial Pattern Matching (2007)

  13. No Access

    Chapter and Conference Paper

    Approximate String Matching with Address Bit Errors

    A string S ∈ Σ m can be viewed as a set of pairs S = { (σ i , i) : i ∈ { 0,..., m − 1} }. We consider approx...

    Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy… in Combinatorial Pattern Matching (2008)

  14. No Access

    Chapter and Conference Paper

    Quasi-distinct Parsing and Optimal Compression Methods

    In this paper, the optimality proof of Lempel-Ziv coding is re-studied, and a much more general compression optimality theorem is derived. In particular, the property of quasi-distinct parsing is defined. This pr...

    Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko in Combinatorial Pattern Matching (2009)

  15. No Access

    Chapter and Conference Paper

    A PTAS for the Square Tiling Problem

    The Square Tiling Problem was recently introduced as equivalent to the problem of reconstructing an image from patches and a possible general-purpose indexing tool. Unfortunately, the Square Tiling Problem was...

    Amihood Amir, Alberto Apostolico… in String Processing and Information Retrieval (2010)

  16. No Access

    Chapter and Conference Paper

    Approximate String Matching with Stuck Address Bits

    A string S ∈ Σ m can be viewed as a set of pairs $\{ (s_i , i) \mid s_i\in S,\ i\in \{ 0,\ldots, m-...

    Amihood Amir, Estrella Eisenberg… in String Processing and Information Retrieval (2010)

  17. No Access

    Chapter and Conference Paper

    Approximations and Partial Solutions for the Consensus Sequence Problem

    The problem of finding the consensus of a given set of strings is formally defined as follows: given a set of strings S = {s 1,…s k }, and ...

    Amihood Amir, Haim Paryenty, Liam Roditty in String Processing and Information Retrieval (2011)

  18. No Access

    Chapter and Conference Paper

    Weighted Shortest Common Supersequence

    The Shortest Common Supersequence (SCS) is the problem of seeking a shortest possible sequence that contains each of the input sequences as a subsequence. In this paper we consider applying the problem to Positio...

    Amihood Amir, Zvi Gotthilf, B. Riva Shalom in String Processing and Information Retrieval (2011)

  19. No Access

    Chapter and Conference Paper

    Approximate Period Detection and Correction

    Periodicity has been historically well studied and has numerous applications. In nature, however, few cyclic phenomena have an exact period.

    Amihood Amir, Avivit Levy in String Processing and Information Retrieval (2012)

  20. No Access

    Chapter and Conference Paper

    Configurations and Minority in the String Consensus Problem

    The Closest String Problem is defined as follows. Let S be a set of k strings {s 1,…s k }, each of length ℓ, find a string

    Amihood Amir, Haim Paryenty, Liam Roditty in String Processing and Information Retrieval (2012)

previous disabled Page of 2