Information retrieval: data structures and algorithms
Information retrieval: data structures and algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Journal of the ACM (JACM)
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Indexing and Retrieval of Audio: A Survey
Multimedia Tools and Applications
A Fragment-Based Approach to Object Representation and Classification
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Efficient text fingerprinting via Parikh mapping
Journal of Discrete Algorithms
Identifying Semantically Equivalent Object Fragments
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Distinctive regions of 3D surfaces
ACM Transactions on Graphics (TOG)
Globally Consistent Reconstruction of Ripped-Up Documents
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
Many applications have a need for indexing unstructured data. It turns out that a similar ad-hoc method is being used in many of them - that of considering small particles of the data. In this paper we formalize this concept as a tiling problem and consider the efficiency of dealing with this model in the pattern matching setting. We present an efficient algorithm for the one-dimensional tiling problem, and the one-dimensional tiled pattern matching problem. We prove the two-dimensional problem is hard and then develop an approximation algorithm with an approximation ratio converging to 2. We show that other two-dimensional versions of the problem are also hard, regardless of the number of neighbors a tile has.