Výsledky vyhľadávania - Bit-parallel algorithms

An exact bit-parallel algorithm for the maximum clique problem Autor San Segundo, Pablo, Rodríguez-Losada, Diego, Jiménez, Agustín

“…This paper presents a new exact maximum clique algorithm which improves the bounds obtained in state of the art approximate coloring by reordering the vertices at each step…”
Získať plný text

A Bit-Parallel Tabu Search Algorithm for Finding Es2-Optimal and Minimax-Optimal Supersaturated Designs Autor Morales, Luis B., Bulutoglu, Dursun A.

“…∈2,4,6 as a search for RIBDs whose blocks intersect accordingly. This allows developing a bit-parallel tabu search (TS) algorithm…”
Získať plný text

A bit-parallel algorithm for searching multiple patterns with various lengths Autor Kusudo, Ko, Ino, Fumihiko, Hagihara, Kenichi

“…In this paper, we present an Advanced Vector Extensions (AVX) accelerated method for a bit-parallel algorithm that realizes fast string search for maximizing stable search throughput…”
Získať plný text

Novel bit-parallel multiplier for GF(2m) defined by all-one polynomial using generalized Karatsuba algorithm Autor Xie, Xiao-ning, Chen, Gong-liang, Li, Yin

“…In this paper, a novel bit-parallel multiplier for finite field GF(2m) defined by irreducible all-one polynomial (AOP) is proposed…”
Získať plný text

A BIT-PARALLEL ALGORITHM FOR SEQUENTIAL PATTERN MATCHING WITH WILDCARDS Autor Guo, Dan, Hong, Xiao-Li, Hu, Xue-Gang, Gao, Jun, Liu, Ying-Ling, Wu, Gong-Qing, Wu, Xindong

“… Among the algorithms to solve the problem, the most efficient one is SAIL, which is time consuming, especially when the pattern is long…”
Získať plný text

BitPAl: a bit-parallel, general integer-scoring sequence alignment algorithm Autor Loving, Joshua, Hernandez, Yozen, Benson, Gary

“…) and edit-distance problems, producing fast algorithms in practice. Results: We have developed BitPAl, a bit-parallel algorithm for general, integer-scoring global alignment…”
Získať plný text

Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism Autor Kaneta, Yusaku, Arimura, Hiroki, Raman, Rajeev

“…>w, we present an efficient algorithm that solves the problem in O(nmlog(w)/w) time using O(hm/w+mlog(w)/w) space and O(mlog(w)) preprocessing on a unit-cost…”
Získať plný text

An improved bit parallel exact maximum clique algorithm Autor San Segundo, Pablo, Matia, Fernando, Rodriguez-Losada, Diego, Hernando, Miguel

“… ), a leading maximum clique algorithm which uses bit strings to efficiently compute basic operations during search by bit masking…”
Získať plný text

An Efficient Algorithm for Continuous Complex Event Matching Using Bit-Parallelism Autor Qiu, Tao, Jiang, Shenwang, Yang, Xiaochun, Wang, Bin, Zong, Chuanyu, Zhu, Rui

“…Complex event matching has gained a lot of at-tention for evaluating complex queries over event streams. The events composing a complex event occur within a…”
Získať plný text

COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES Autor Muhammad Yusuf Muhammad, Mathias Fonkam, Salu George Thandekatu, Sandip Rakshit, Rao Narasimha Vajjhala

“… The use of recently developed bit parallel string matching algorithms approaches helps in improving the efficiency of the other string pattern matching algorithms…”
Získať plný text

A Bit-Parallel Tabu Search Algorithm for Finding E s 2 -Optimal and Minimax-Optimal Supersaturated Designs Autor Morales, Luis B., Bulutoglu, Dursun A.

“… ∈ 2 , 4 , 6 as a search for RIBDs whose blocks intersect accordingly. This allows developing a bit-parallel tabu search (TS) algorithm…”
Získať plný text

Efficient Bit-Parallel Multiplier for All Trinomials Based on n-Term Karatsuba Algorithm Autor Park, Sun-Mi, Chang, Ku-Young, Hong, Dowon, Seo, Changho

“… on <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula>-term Karatsuba algorithm (KA…”
Získať plný text

Parallelizing Exact and Approximate String Matching via Inclusive Scan on a GPU Autor Mitani, Yasuaki, Ino, Fumihiko, Hagihara, Kenichi

“…In this study, to substantially improve the runtimes of exact and approximate string matching algorithms, we propose a tribrid parallel method for bit-parallel algorithms such as the Shift-Or and Wu-Manber algorithms…”
Získať plný text

Bit-parallel approximate pattern matching: Kepler GPU versus Xeon Phi Autor Tran, Tuan Tu, Liu, Yongchao, Schmidt, Bertil

“… Bit-parallel APM takes advantage of the intrinsic parallelism of bitwise operations inside a machine word…”
Získať plný text

A bit-parallel dynamic programming algorithm suitable for DNA sequence alignment Autor Kimura, Kouichi, Koike, Asako, Nakai, Kenta

“…Myers' elegant and powerful bit-parallel dynamic programming algorithm for approximate string matching has a restriction that the query length should be within the word size of the computer, typically 64…”
Zistit podrobnosti o prístupe

BLIM: A New Bit-Parallel Pattern Matching Algorithm Overcoming Computer Word Size Limitation Autor Külekci, M. Oğuzhan

“…Bitwise operations are executed very fast in computer architecture. Algorithms aiming to benefit from this intrinsic property can be classified as bit-parallel algorithms…”
Získať plný text

Optical implementation of a constant-time multicomparand bit-parallel magnitude-comparison algorithm using wavelength- and polarization-division multiplexing with application to parallel database processing Autor Detofsky, A, Choo, P Y, Louri, A

“…We present a word- and bit-parallel magnitude-comparison architecture that permits multiple comparands to be compared with multiple relations in constant time…”
Zistit podrobnosti o prístupe

Low-Complexity Bit-Parallel Multipliers for a Class of Gf(2m) Based on Modified Booth's Algorithm Autor Lee, C.-Y., Chiou, C.W.

“… to develop a new multiplexer-based bit-parallel multiplier that is simple and modular and such properties are important for VLSI…”
Získať plný text

Complexity Analysis and Efficient Implementations of Bit Parallel Finite Field Multipliers Based on Karatsuba-Ofman Algorithm on FPGAs Autor Gang Zhou, Michalik, Harald, Hinsenkamp, László

“…) and on field-programmable gate arrays (FPGAs)] and efficient FPGA implementations of bit parallel mixed Karatsuba-Ofman multipliers (KOM) over GF(2 m…”
Získať plný text

A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching Autor Blažej, Václav, Suchý, Ondřej, Valla, Tomáš

“… The goal is to design fast matching algorithm that takes advantage of the bit parallelism of bitwise machine instructions and has only streaming access to the input…”
Získať plný text