In the packed string matching problem, each machine word accommodates α characters, thus an n-character text occupies n/α memory words. We extend the Crochemore-Perrin constantspace O(n)-time string matching algorithm to run in optimal O(n/α) time and even in real-time, achieving a factor α speedup over traditional algorithms that examine each character individually. Our solution can be efficie...

The exact string matching problem is to find the occurrences of a pattern of length m from a text of length n symbols. We develop a novel and unorthodox filtering technique for this problem. Our method is based on transforming the problem into multiple matching of carefully chosen pattern subsequences. While this is seemingly more difficult than the original problem, we show that the idea leads...

Model based object recognition systems have rarely dealt directly with D perspective while matching models to images The algorithms presented here use D pose recovery during matching to explicitly and quantitatively account for changes in model appearance associated with D per spective These algorithms use random start local search to nd with high probability the globally optimal correspondence...

We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problems--polynomial-time solvability, rain-max theorems, and totally dual integral polyhedral descriptions. New applications of these results include a strongly polynomial separation algorithm fo...

computation of the second order delay in rc-tree based circuits is important during the design process of modern vlsi systems with respect to having tree structure circuits. calculation of the second and higher order moments is possible in tree based networks. because of the closed form solution, computation speed and the ease of using the performance optimization in vlsi design methods such as...

In this paper we will consider tight upper and lower bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of its cardinality. Specifically, given two n sets of points R = {r1, ..., rn} and B = {b1, ..., bn} distributed uniformly and randomly on the m leaves of λ-Hierarchically Separated Trees with branching factor b such that e...

The application of the theory of deformable templates to the study of the action of a group of diffeomorphisms on deformable objects provides a powerful framework to compute dense one-to-one matchings on d-dimensional domains. In this paper, we derive the geodesic equations that govern the time evolution of an optimal matching in the case of the action on 2D curves with various driving matching...

Introduction: The problem of compressed pattern matching deals with ways to find a pattern within a compressed file, without decompressing it first. The techniques for solving this problem fall into two major categories – creating a unique compression scheme that enables efficient pattern matching; or using some known compression scheme and develop algorithms to search the files it produces. In...