1862 search results - page 71 / 373 » Constrained pattern matching |
110
Voted
RSA
2002
15 years 10 days ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
122
Voted
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...
105
Voted
IPL
2007
15 years 14 days ago
2007
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
114
click to vote
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
We propose a spectral learning approach to shape segmentation. The method is composed of a constrained spectral clustering algorithm that is used to supervise the segmentation of a...
ALGORITHMICA
2008
15 years 25 days ago
2008
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...