Results 1 to 10 of about 319,166 (311)
Spherical Polar Pattern Matching for Star Identification [PDF]
SensorsTo endow a star sensor with strong robustness, low algorithm complexity, and a small database, this paper proposes an all-sky star identification algorithm based on spherical polar pattern matching.
Jingneng Fu, Ling Lin, Qiang Li
doaj +2 more sources
Improved LINE-1 Detection through Pattern Matching by Increasing Probe Length [PDF]
BiologyLong Interspersed Element-1 (LINE-1 or L1) is an autonomous transposable element that accounts for 17% of the human genome. Strong correlations between abnormal L1 expression and diseases, particularly cancer, have been documented by numerous studies ...
Juan O. López +2 more
doaj +2 more sources
Adaptive Non-linear Pattern Matching Automata [PDF]
Logical Methods in Computer Science, 2021 Efficient pattern matching is fundamental for practical term rewrite engines. By preprocessing the given patterns into a finite deterministic automaton the matching patterns can be decided in a single traversal of the relevant parts of the input term ...
Rick Erkens, Maurice Laveaux
doaj +1 more source
Accelerating Pattern Matching Using a Novel Multi-Pattern-Matching Algorithm on GPU
Applied Sciences, 2023 Nowadays, almost all network traffic is encrypted. Attackers hide themselves using this traffic and attack over encrypted channels. Inspections performed only on packet headers and metadata are insufficient for detecting cyberattacks over encrypted ...
Merve Çelebi, Uraz Yavanoğlu
doaj +1 more source
Pattern Matching Based on Object Graphs
IEEE Access, 2021 Pattern matching has been widely adopted in functional programming languages, and is gradually getting popular in OO languages, from Scala to Python.
Wei Ke, Ka-Hou Chan
doaj +1 more source
PalFM-Index: FM-Index for Palindrome Pattern Matching [PDF]
, 2023 The palindrome pattern matching (pal-matching) is a kind of generalized pattern matching, in which two strings x and y of same length are considered to match (pal-match) if they have the same palindromic structures, i.e., for any possible 1 ≤ i < j ≤ |x|
I, Tomohiro, Nagashita, Shinya
core +1 more source
Order-Preserving Multiple Pattern Matching in Parallel
Applied Sciences, 2023 The order-preserving multiple pattern matching problem is to find all substrings of T whose relative orders are the same for any pattern in a set of patterns.
Somin Park +3 more
doaj +1 more source
Lazy AC-Pattern Matching for Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of a pattern-matching problem are stored in a lazy list composed of a first substitution at the head and a non-evaluated object that encodes the remaining ...
Walid Belkhir, Alain Giorgetti
doaj +1 more source
Algebraic Pattern Matching in Join Calculus [PDF]
Logical Methods in Computer Science, 2008 We propose an extension of the join calculus with pattern matching on algebraic data types. Our initial motivation is twofold: to provide an intuitive semantics of the interaction between concurrency and pattern matching; to define a practical ...
Qin Ma, Luc Maranget
doaj +1 more source
Parallel algorithm for pattern matching problems under substring consistent equivalence relations [PDF]
, 2022 Given a text and a pattern over an alphabet, the pattern matching problem searches for all occurrences of the pattern in the text. An equivalence relation $\approx$ is called a substring consistent equivalence relation (SCER), if for two strings $X$ and $
Shinohara, Ayumi +3 more
core +1 more source