Results 71 to 80 of about 70,442,116 (202)
Algorithms for approximate string matching
Information and Control, 1985 This is a revised and expanded version of the author's paper in Lect. Notes Comput. Sci. 158, 487-495 (1983; Zbl 0532.68088).
openaire +3 more sources
Strings And Colorings Of Topological Coding Towards Asymmetric Topology Cryptography [PDF]
, 2022 We, for anti-quantum computing, will discuss various number-based strings, such as number-based super-strings, parameterized strings, set-based strings, graph-based strings, integer-partitioned and integer-decomposed strings, Hanzi-based strings, as well
Yao, Bing +7 more
core
The Observational Signatures of Cosmic Strings [PDF]
, 2009 Cosmic strings were postulated by Kibble in 1976 and, from a theoretical point of view, their existence finds support in modern superstring theories, both in compactification models and in theories with extended additional dimensions.
Riccio, Giuseppe
core +1 more source
Fault diagnosis of photovoltaic strings by using machine learning‐based stacking classifier
IET Renewable Power GenerationPhotovoltaic (PV) modules are prone to short circuits, open circuits, cracks, which can bring serious harmful effects. It is difficult to establish the corresponding PV fault models to diagnose the status of PV strings.
Bo Liu +4 more
doaj +1 more source
Algorithm engineering : string processing [PDF]
, 2002 The string matching problem has attracted a lot of interest throughout the history of computer science, and is crucial to the computing industry. The theoretical community in Computer Science has a developed a rich literature in the design and analysis of string matching algorithms.
openaire +2 more sources
Polygraph: Automatically generating signatures for polymorphic worms [PDF]
, 2005 It is widely believed that content-signature-based intrusion detection systems (IDSes) are easily evaded by polymorphic worms, which vary their payload on every infection attempt.
Newsome, J, Song, D, Karp, B
core
Approximation Algorithms for String Folding Problems [PDF]
, 2000 We present polynomial-time approximation algorithms for string folding problems over any finite alphabet. Our idea is the following: describe a class of feasible solutions by means of an ambiguous context-free grammar (i.e. there is a bijection between the set of parse trees and a subset of possible embeddings of the string); give a score to every ...
Giancarlo Mauri, Giulio Pavesi
openaire +2 more sources
Quantum Algorithms for Classical Probability Distributions [PDF]
, 2019 We study quantum algorithms working on classical probability distributions. We formulate four different models for accessing a classical probability distribution on a quantum computer, which are derived from previous work on the topic, and study their ...
Belovs, Aleksandrs
core +1 more source
Congress of Strings, July 3, 1980 [PDF]
, 1980 Concert program for Congress of Strings, July 3 ...
core
Congress of Strings, July 17, 1980 [PDF]
, 1980 Concert program for Congress of Strings, July 17 ...
core