Towards a Theory of Patches

Authors:
Amihood Amir;Haim Parienty
Affiliations:
Department of Computer Science, Bar Ilan University, Ramat Gan, Israel 52900 and Department of Computer Science, Johns Hopkins University, Baltimore 21218;Department of Computer Science, Bar Ilan University, Ramat Gan, Israel 52900
Venue:
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Year:
2009

Citing 13
Cited 1

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
On Context-Free Languages

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
Introduction to Information Retrieval

Introduction to Information Retrieval

A PTAS for the square tiling problem

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. We present an efficient algorithm for the one dimension tiling problem, and prove the two dimension problem is hard. We then develop an approximation algorithm with an approximation ratio converging to 2. We show that the "one-and-a-half" dimensional version of the problem is also hard.