In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
Pattern Databases were a major breakthrough in heuristic search by solving hard combinatorial problems various orders of magnitude faster than state-of-the-art techniques at that ...
Many applications refer to moving objects or phenomena and require spatio-temporal modelling and specific analysis. Unlike conventional data where attributes are simple values (nu...
Abstract Stable signal transmission is crucial for information processing by the brain. Synfire-chains, defined as feedforward networks of spiking neurons, are a well-studied class...