Suchergebnisse - flexible string algorithm

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

“… In this investigation, an iterative inverse design method for 2-D subsonic ducts is presented. In the proposed method, the duct walls shape is changed under a novel algorithm based on the deformation of a virtual flexible string in flow …”
Volltext

Duct Design in Subsonic and Supersonic Flow Regimes with and without Normal Shock Waves Using Flexible String Algorithm von Nili-Ahmadabadi, M, Durali, M, Hajilouy-Benisi, A, Ghadak, F

“… In this investigation, the Flexible String Algorithm (FSA) used before for the inverse design of 2D subsonic ducts is developed and applied for the inverse design of subsonic and supersonic ducts with and without normal shock waves …”
Volltext

Duct Design in Subsonic and Supersonic Flow Regimes with and without Normal Shock Waves Using Flexible String Algorithm von Nili-Ahmadabadi, M, Durali, M, Hajilouy-Benisi, A, Ghadak, F

“… In this investigation, the Flexible String Algorithm (FSA) used before for the inverse design of 2D subsonic ducts is developed and applied for the inverse design of subsonic and supersonic ducts with and without normal shock waves …”
Volltext

A programmable array processor architecture for flexible approximate string matching algorithms von Michailidis, Panagiotis D., Margaritis, Konstantinos G.

“… s. This paper proposes a generic design of a programmable array processor architecture for a wide variety of approximate string matching algorithms to gain high performance at low cost …”
Volltext

Flexible pattern matching algorithm in Chinese strings von Zhou Xueguang, Zhang Huanguo

“… In this paper we give a formulized definition of flexible pattern matching in Chinese strings, and compare the classical algorithms for pattern matching in strings, and choose the prefix searching …”
Volltext

A programmable array processor architecture for flexible approximate string matching algorithms von Michailidis, P.D., Margaritis, K.G.

“… This paper proposes a generic programmable array processor architecture for a wide variety of approximate string matching algorithms …”
Volltext

Fast and flexible packed string matching von Faro, Simone, Külekci, M. Oğuzhan

“… In the last two decades a general trend has appeared trying to exploit the power of the word RAM model to speed-up the performances of classical string matching algorithms …”
Volltext

Flexible and Efficient Algorithms for Abelian Matching in Strings von Faro, Simone, Pavone, Arianna

“… In this short communication we present a new class of algorithms based on a new efficient fingerprint computation approach, called Heap-Counting, which turns out to be fast, flexible and easy to be implemented …”
Volltext

Pattern-Matching Toolkit has many applications - Flexible Pattern-Matching in Strings: Practical. On-line Search Algorithms for Texts and Biological Sequences von Mann, C.J.H

“… "Flexible Pattern-Matching in Strings: Practical. On-line Search Algorithms for Texts and Biological Sequences" by Gonzalo Navarro and Mathieu Raffinot …”
Volltext

Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching von Hyyrö, Heikki

“… Raffinot, Flexible Pattern Matching in Strings—Practical On-line Search Algorithms for Texts and Biological Sequences, Cambridge University Press, Cambridge, UK, 2002 …”
Volltext

Processor array architectures for flexible approximate string matching von Michailidis, Panagiotis D., Margaritis, Konstantinos G.

“… In this paper, we present linear processor array architectures for flexible approximate string matching …”
Volltext

Multi-pattern matching with variable-length wildcards using suffix tree von Liu, Na, Xie, Fei, Wu, Xindong

“… Most of the previously developed multi-pattern matching methods, such as famous Aho–Corasick and Wu–Manber algorithms, aimed to solve some classical string matching problems …”
Volltext

A Multi-Mode Flexible Power Point Tracking Algorithm for Photovoltaic Power Plants von Tafti, Hossein Dehghani, Townsend, Christopher D., Konstantinou, Georgios, Pou, Josep

“… ) strings during voltage sags was previously proposed by the authors. An advantage of this algorithm, compared to conventional FPPT algorithms, was its fast dynamics …”
Volltext

The Pattern Matching Algorithms Formalized Analyze in Chinese Strings von Di Wu, Xueguang Zhou, Huanguo Zhang

“… In order to mine the distorted keywords, a flexible pattern matching algorithm in Chinese strings was presented and formalization analyzed according to the theory of pattern matching …”
Volltext

Articulated Human Detection with Flexible Mixtures of Parts von Yi Yang, Ramanan, Deva

“… We describe a general, flexible mixture model that jointly captures spatial relations between part locations and co-occurrence relations between part mixtures, augmenting standard pictorial structure …”
Volltext

Flexible Pattern Matching in Strings: Practical Online Search Algorithms for Texts and Biological Sequences [Book Review] von Lutz, M.J.

Volltext

Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences

Volltext

Spatial reasoning and similarity retrieval for image database systems based on RS-strings von Huang, P.W., Jean, Y.R.

“… The similarity retrieval algorithm is much more flexible than all previous 2D string representations because our approach can consider every possible view of a query picture …”
Volltext

Dynamic modeling and vibration control of a three-dimensional flexible string with variable length and spatiotemporally varying parameters subject to input constraints von Xing, Xueyan, Liu, Jinkun, Liu, Zhijie

“… In this paper, a three-dimensional dynamic model is developed for a flexible string system with variable length as well as spatiotemporally varying parameters …”
Volltext

A VLSI PROCESSOR ARRAY FOR FLEXIBLE STRING MATCHING von MARGARITIS, K. G., EVANS, D. J.

“… This paper presents a systolic design for flexible string matching. Initially a sequential algorithm is discussed which consists of two phases, i.e …”
Volltext