253 search results - page 1 / 51 » The Sketching Complexity of Pattern Matching |
APPROX
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
PAMI
2011
12 years 11 months ago
2011
—The problem of matching a forensic sketch to a gallery of mug shot images is addressed in this paper. Previous research in sketch matching only offered solutions to matching hig...
ISAAC
2001
Springer
13 years 9 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
CHI
2002
ACM
14 years 5 months ago
2002
ACM
Informal, sketch-based design tools closely match the work practices of user interface designers. Current tools, however, are limited in the size and complexity of interaction tha...
UIST
2004
ACM
13 years 10 months ago
2004
ACM
We present SketchREAD, a multi-domain sketch recognition engine capable of recognizing freely hand-drawn diagrammatic sketches. Current computer sketch recognition systems are dif...