Linking Spatial Named Entities to the Web of Data for Geographical Analysis of Historical Texts

Paris, Pierre-Henri; Abadie, Nathalie; Brando, Carmen

doi:10.1080/15420353.2017.1307306

Cited by 5 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To construct the approximate pattern matching algorithm, we need a function to measure the string similarity. The most commonly used similarities are recalled in [19,20,21]. Bakkelund [1] proposed a well known string similarity measure which is based on the longest commonly subsequence.…”

Section: Automata Technique For Pattern Matching On Encrypted Datamentioning

confidence: 99%

A Novel Cryptosystem Based on Steganography and Automata Technique for Searchable Encryption

2020

KSII TIIS

View full text Add to dashboard Cite

In this paper we first propose a new cryptosystem based on our data hiding scheme (2,9,8) introduced in 2019 with high security, where encrypting and hiding are done at once, the ciphertext does not depend on the input image size as existing hybrid techniques of cryptography and steganography. We then exploit our automata approach presented in 2019 to design two algorithms for exact and approximate pattern matching on secret data encrypted by our cryptosystem. Theoretical analyses remark that these algorithms both have O(n) time complexity in the worst case, where for the approximate algorithm, we assume that it uses (1 ) ) m ε −     processors, where ε , m and n are the error of our string similarity measure and lengths of the pattern and secret data, respectively. In searchable encryption, our cryptosystem is used by users and our pattern matching algorithms are performed by cloud providers.

show abstract

Section: Automata Technique For Pattern Matching On Encrypted Datamentioning

confidence: 99%

A Novel Cryptosystem Based on Steganography and Automata Technique for Searchable Encryption

2020

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…The longest common subsequence (LCS) problem is a well-known problem in computer science [2,3,7,8] and has many applications [1,8,14], especially in approximate pattern matching [8,10,12]. In 1972, authors V. Chvatal, D. A. Klarner and D. Knuth listed the problem of finding the longest common subsequence of the two strings in 37 selected combinatorial research problems [3].…”

Section: Introductionmentioning

confidence: 99%

“…For the approximate pattern matching problem, the length of a longest common subsequence of two strings is used to compute the similarity between the two strings [10,12]. Our work is concerned with the problem of finding the length of a longest subsequence of two strings of lengths m and n. In addition, our main objective is planning to deal with the approximate search problem in the future.…”

Section: Introductionmentioning

confidence: 99%

Automata Technique for The LCS Problem

Nguyễn

2019

JCC

View full text Add to dashboard Cite

In this paper, we introduce two eﬃcient algorithms in practice for computing the length of a longest common subsequence of two strings, using automata technique, in sequential and parallel ways. For two input strings of lengths m and n with m ≤ n, the parallel algorithm uses k processors (k ≤ m) and costs time complexity O(n) in the worst case, where k is an upper estimate of the length of a longest common subsequence of the two strings. These results are based on the Knapsack Shaking approach proposed by P. T. Huy et al. in 2002. Experimental results show that for the alphabet of size 256, our sequential and parallel algorithms are about 65.85 and 3.41m times faster than the standard dynamic programming algorithm proposed by Wagner and Fisher in 1974, respectively.

show abstract

Fostering Exploration of Georeferenced Data Semantics for Supporting E-government Initiatives

Maigua-Quinteros¹,

Perez-Nata²,

Peña³

et al. 2018

2018 International Conference on eDemocracy &Amp; eGovernment (ICEDEG)

View full text Add to dashboard Cite

Linking Spatial Named Entities to the Web of Data for Geographical Analysis of Historical Texts

Cited by 5 publications

References 22 publications

A Novel Cryptosystem Based on Steganography and Automata Technique for Searchable Encryption

A Novel Cryptosystem Based on Steganography and Automata Technique for Searchable Encryption

Automata Technique for The LCS Problem

Fostering Exploration of Georeferenced Data Semantics for Supporting E-government Initiatives

Contact Info

Product

Resources

About