Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Paniz Abedin"'
Publikováno v:
IEEE Open Journal of Intelligent Transportation Systems, Vol 5, Pp 307-321 (2024)
This paper presents an incentive mechanism for vehicular crowdsensing (VCS). Here, a platform selects a set of spots or Places of sensing Interest (PsI) and outsources the collection of data from these places. In particular, the platform is intereste
Externí odkaz:
https://doaj.org/article/bcc93a5a862a48e583b3c5402d7ff805
Publikováno v:
Applied Sciences, Vol 12, Iss 21, p 10746 (2022)
The purpose of this article is to illustrate an investigation of methods that can be effectively used to predict the data incompleteness of a dataset. Here, the investigators have conceptualized data incompleteness as a random variable, with the over
Externí odkaz:
https://doaj.org/article/9ad8ec5f00434514b4fc63d53bb2b6f0
Publikováno v:
Algorithms, Vol 13, Iss 11, p 276 (2020)
Let T[1,n] be a string of length n and T[i,j] be the substring of T starting at position i and ending at position j. A substring T[i,j] of T is a repeat if it occurs more than once in T; otherwise, it is a unique substring of T. Repeats and unique su
Externí odkaz:
https://doaj.org/article/b14b1c6800df4645a05cf5809f528568
Publikováno v:
Algorithms, Vol 13, Iss 9, p 224 (2020)
The shortest unique substring (SUS) problem is an active line of research in the field of string algorithms and has several applications in bioinformatics and information retrieval. The initial version of the problem was proposed by Pei et al. [ICDE
Externí odkaz:
https://doaj.org/article/b2e4f17160da4c738890b7b81b2ae4df
Publikováno v:
2023 Data Compression Conference (DCC).
Publikováno v:
Algorithmica. 84:2088-2105
Autor:
Wing-Kai Hon, Kotaro Matsuda, Sharma V. Thankachan, Paniz Abedin, Yakov Nekrich, Rahul Shah, Arnab Ganguly, Kunihiko Sadakane
Publikováno v:
Theoretical Computer Science. 822:15-22
Let T [ 1 , n ] be a text of length n and T [ i , n ] be the suffix starting at position i. Also, for any two strings X and Y, let LCP ( X , Y ) denote their longest common prefix. The range-LCP of T w.r.t. a range [ α , β ] , where 1 ≤ α β ≤
Publikováno v:
Fundamenta Informaticae. 163:267-273
The Average Common Substring (ACS) is a popular alignment-free distance measure for phylogeny reconstruction. The ACS can be computed in O(n) space and time, where n=x+y is the input size. The compressed string matching is the study of string matchin
The non-overlapping indexing problem is defined as follows: pre-process a given text T [ 1 , n ] of length n into a data structure such that whenever a pattern P [ 1 , m ] comes as an input, we can efficiently report the largest set of non-overlappin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cd795c04bd0d62ccf342f2f48361721
https://aperta.ulakbim.gov.tr/record/237248
https://aperta.ulakbim.gov.tr/record/237248
Publikováno v:
Algorithms, Vol 13, Iss 224, p 224 (2020)
Algorithms
Volume 13
Issue 9
Algorithms
Volume 13
Issue 9
The shortest unique substring (SUS) problem is an active line of research in the field of string algorithms and has several applications in bioinformatics and information retrieval. The initial version of the problem was proposed by Pei et al. [ICDE&