Výsledky vyhledávání - (("string algorithm") OR ("springer algorithm"))

Simon's congruence pattern matching Autor Kim, Sungmin, Ko, Sang-Ki, Han, Yo-Sub

“…The Simon's congruence problem is to determine whether or not two strings have the same set of subsequences of length no greater than a given integer, and the…”
Získat plný text

Tunnel: Parallel-inducing sort for large string analytics Autor Du, Zhihui, Zhang, Sen, Bader, David A.

Získat plný text

Accurate Changing Point Detection for l1 Mean Filtering Autor Ottersten, Johan, Wahlberg, Bo, Rojas, Cristian

Získat plný text

Solving String Problems on Graphs Using the Labeled Direct Product Autor Rizzo, Nicola, Tomescu, Alexandru I., Policriti, Alberto

“…Suffix trees are an important data structure at the core of optimal solutions to many fundamental string problems, such as exact pattern matching , longest…”
Získat plný text

Constructing Antidictionaries of Long Texts in Output-Sensitive Space Autor Ayad, Lorraine A.K., Badkobeh, Golnaz, Fici, Gabriele, Héliou, Alice, Pissis, Solon P.

“…A word x that is absent from a word y is called minimal if all its proper factors occur in y . Given a collection of k words y 1 , … , y k over an alphabet Σ ,…”
Získat plný text

Accurate Changing Point Detection for l(1) Mean Filtering Autor Ottersten, Johan, Wahlberg, Bo, Rojas, Cristian R.

“…It is often desirable to find the underlying trends in time series data. This is a well known signal processing problem that has many applications in areas…”
Získat plný text

Towards Self-learning Industrial Process Behaviour from Payload Bytes for Anomaly Detection Autor Meshram, Ankush, Karch, Markus, Haas, Christian, Beyerer, Jurgen

“…Network Intrusion Detection System (NIDS) for process-based anomaly detection have been developed as one of the cybersecurity solutions against industrial…”
Získat plný text

Using the longest run subsequence problem within homology-based scaffolding Autor Schrinner, Sven, Goel, Manish, Wulfert, Michael, Spohr, Philipp, Schneeberger, Korbinian, Klau, Gunnar W.

“…Genome assembly is one of the most important problems in computational genomics. Here, we suggest addressing an issue that arises in homology-based…”
Získat plný text

Irredundant tandem motifs Autor Parida, Laxmi, Pizzi, Cinzia, Rombo, Simona E.

“…Eliminating the possible redundancy from a set of candidate motifs occurring in an input string is fundamental in many applications. The existing techniques…”
Získat plný text

A Modified Median String Algorithm for Gene Regulatory Motif Classification Autor Kaysar, Mohammad Shibli, Khan, Mohammad Ibrahim

“…Consensus string is a significant feature of a deoxyribonucleic acid (DNA) sequence. The median string is one of the most popular exact algorithms to find DNA…”
Získat plný text

Accurate Changing Point Detection for Mean Filtering Autor Ottersten, Johan, Wahlberg, Bo, Rojas, Cristian R.

“…It is often desirable to find the underlying trends in time series data. This is a well known signal processing problem that has many applications in areas…”
Získat plný text

Splines in Higher Order TV Regularization Autor Steidl, Gabriele, Didas, Stephan, Neumann, Julia

“…Issue Title: Special Issue: The 5th International Conference on Scale-Space and PDE Methods in Computer Vision Splines play an important role as solutions of…”
Získat plný text

Pattern matching with wildcards and length constraints using maximum network flow Autor Arslan, Abdullah N., He, Dan, He, Yu, Wu, Xindong

“…In 2006 Chen et al. introduced an interesting text pattern matching problem with unique features. A pattern is described by a sequence of letters (literals)…”
Získat plný text

A new framework for subimage analysis Autor Arslan, Abdullah N.

“…We develop new methods for several subimage analysis problems. Images in two dimensions are represented by matrixes (higher dimensional images are represented…”
Získat plný text

Fast algorithms for finding a minimum repetition representation of strings and trees Autor Nakamura, Atsuyoshi, Saito, Tomoya, Takigawa, Ichigaku, Kudo, Mineichi, Mamitsuka, Hiroshi

“…A string with many repetitions can be represented compactly by replacing h-fold contiguous repetitions of a string r with (r)h. We present a compact…”
Získat plný text

Probabilistic Arithmetic Automata and Their Applications Autor Marschall, T., Herms, I., Kaltenbach, H., Rahmann, S.

“…We present a comprehensive review on probabilistic arithmetic automata (PAAs), a general model to describe chains of operations whose operands depend on…”
Získat plný text

Inverse design of 2-D subsonic ducts using flexible string algorithm Autor Nili-Ahmadabadi, Mahdi, Durali, Mohammad, Hajilouy-Benisi, Ali, Ghadak, Farhad

“…The duct inverse design in fluid flow problems usually involves finding the wall shape associated with a prescribed distribution of wall pressure or velocity…”
Získat plný text

Catanduanes State University Employee Profiling Management System Implementing Knuth-Morris-Pratt Search String Algorithm Autor Magtangob, Ramona Michelle M., Vera, Maria Concepcion S.

“…In the ever-changing world of technology, every organization, including universities whether it is big or small has to overcome human resources challenges…”
Získat plný text

Tube Methods for BV Regularization Autor Hinterberger, Walter, Hintermüller, Michael, Kunisch, Karl, von Oehsen, Markus, Scherzer, Otmar

Získat plný text

An Almost Quadratic Time Algorithm for Sparse Spliced Alignment Autor Sakai, Yoshifumi

“…The sparse spliced alignment problem consists of finding a chain of zero or more exons from O ( n ) prescribed candidate exons of a DNA sequence of length O (…”
Získat plný text