Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
- Publication
Articles 1 - 2 of 2
Full-Text Articles in Theory and Algorithms
Tight Lower Bound For The Sparse Travelling Salesman Problem, Fredrick Mtenzi
Tight Lower Bound For The Sparse Travelling Salesman Problem, Fredrick Mtenzi
Conference papers
The Sparse Travelling Salesman Problem (Sparse TSP) which is a variant of the classical Travelling Salesman Problem (TSP) is the problem of finding the shortest route of the salesman when visiting cities in a region making sure that each city is visited at least once and returning home at the end. In the Sparse TSP, the distance between cities may not obey the triangle inequality; this makes the use of algorithms and formulations designed for the TSP to require modifications in order to produce near-optimal results. A lower bound for optmisation problems gives us the quality guarantee of the near-optimal …
Printed Document Authentication Using Texture Coding, Jonathan Blackledge, Khaled Mahmoud
Printed Document Authentication Using Texture Coding, Jonathan Blackledge, Khaled Mahmoud
Articles
The use of image based information exchange has grown rapidly over the years in terms of both e-to-e image storage and transmission and in terms of maintaining paper documents in electronic form. Further, with the dramatic improvements in the quality of COTS (Commercial-Off-The-Shelf) printing and scanning devices, the ability to counterfeit electronic and printed documents has become a widespread problem. Consequently, there has been an increasing demand to develop digital watermarking techniques which can be applied to both electronic and printed images (and documents) that can be authenticated, prevent unauthorized copying of their content and, in the case of printed …