Results 41 to 50 of about 5,721,874 (232)
Quantum Algorithms for String Processing [PDF]
, 2020 In the paper, we investigate two problems on strings. The first one is the String matching problem, and the second one is the String comparing problem.
Vasiliev, Alexander +4 more
core +2 more sources
Novel Algorithms for Graph Clustering Applied to Human Activities
Mathematics, 2021 In this paper, a novel algorithm (IBC1) for graph clustering with no prior assumption of the number of clusters is introduced. Furthermore, an additional algorithm (IBC2) for graph clustering when the number of clusters is given beforehand is presented ...
Nebojsa Budimirovic, Nebojsa Bacanin
doaj +1 more source
Tube-Based Taut String Algorithms for Total Variation Regularization
Mathematics, 2020 Removing noise from signals using total variation regularization is a challenging signal processing problem arising in many practical applications.
Artyom Makovetskii +3 more
doaj +1 more source
Genetic algorithms and the search for viable string vacua [PDF]
, 2014 A bstractGenetic Algorithms are introduced as a search method for finding string vacua with viable phenomenological properties. It is shown, by testing them against a class of Free Fermionic models, that they are orders of magnitude more efficient than a
S. Abel, J. Rizos
semanticscholar +1 more source
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections
Algorithms for Molecular Biology, 2020 Background The construction of a suffix array for a collection of strings is a fundamental task in Bioinformatics and in many other applications that process strings.
Felipe A. Louza +4 more
doaj +1 more source
String patterns in the doped Hubbard model [PDF]
Science, 2018 Looking for patterns in an optical lattice One of the simplest models of interacting fermions on a two-dimensional (2D) lattice—the Hubbard model—becomes too tricky to simulate on classical computers as the density of empty lattice sites (holes ...
C. Chiu +8 more
semanticscholar +1 more source
A quantum algorithm for string matching
npj Quantum Information, 2021 Algorithms that search for a pattern within a larger data-set appear ubiquitously in text and image processing. Here, we present an explicit, circuit-level implementation of a quantum pattern-matching algorithm that matches a search string (pattern) of ...
Pradeep Niroula, Y. Nam
semanticscholar +1 more source
Hide and Mine in Strings: Hardness and Algorithms [PDF]
2020 IEEE International Conference on Data Mining (ICDM), 2020 We initiate a study on the fundamental relation between data sanitization (i.e., the process of hiding confidential information in a given dataset) and frequent pattern mining, in the context of sequential (string) data. Current methods for string sanitization hide confidential patterns introducing, however, a number of spurious patterns that may harm ...
G. Bernardini (Giulia) +9 more
openaire +5 more sources
Tune retrieval in the multimedia library [PDF]
, 2000 Musical scores are traditionally retrieved by title, composer or subject classification. Just as multimedia computer systems increase the range of opportunities available for presenting musical information, so they also offer new ways of posing musically-
Lloyd A. Smith +7 more
core +1 more source
String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure [PDF]
Symposium on the Theory of Computing, 2019 Burrows–Wheeler transform (BWT) is an invertible text transformation that, given a text T of length n, permutes its symbols according to the lexicographic order of suffixes of T.
Dominik Kempa, Tomasz Kociumaka
semanticscholar +1 more source