作者: fledged 時(shí)間: 2025-3-21 20:32
Parallel Lempel Ziv Coding (Extended Abstract),rs is suggested and it is shown how LZSS and LZW can be adapted to take advantage of such parallel architectures. Experimental results show an improvement in compression and time over standard methods.作者: Tracheotomy 時(shí)間: 2025-3-22 02:52 作者: 蕨類 時(shí)間: 2025-3-22 08:36
What to Do with All this Hardware? (Invited Lecture),on-chip memory start to diminish?.Parallel computing has been a strategic area of growth for computer science since the 1940s. So far, parallel computing affected main stream computer science only in a limited way. The key problem with parallel computers has been their programmability..The parallel 作者: 反抗者 時(shí)間: 2025-3-22 12:09
Efficient Experimental String Matching by Weak Factor Recognition*, on a string ....... .. that acts like an oracle on the set of factors ..... ... If a string is recog- nized by this automaton, it may be a factor of .. But, if it is rejected, it is surely not a factor. We call it factor oracle. More precisely, this au- tomaton is acyclic, recognizes at least the f作者: Diaphragm 時(shí)間: 2025-3-22 13:06
Better Filtering with Gapped q-Grams, the text to identify the text areas that might contain a match. A generalization of the method is to use .-grams, subsets of . characters in some fixed non-contiguous shape, instead of contiguous substrings. Although mentioned a few times in the literature, this gen- eralization has never been stud作者: Diaphragm 時(shí)間: 2025-3-22 20:21
Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract),e vectors that can be expressed as bit sequences. For such problems, the most heavily used measure is the Hamming distance, perhaps normalized. The value of Hamming distances is limited by the fact that it counts only exact matches, whereas in various applications, corresponding bits that are close 作者: Minutes 時(shí)間: 2025-3-23 00:32 作者: characteristic 時(shí)間: 2025-3-23 04:43 作者: 和諧 時(shí)間: 2025-3-23 08:28 作者: 收集 時(shí)間: 2025-3-23 13:42 作者: 不可接觸 時(shí)間: 2025-3-23 16:59 作者: 膽大 時(shí)間: 2025-3-23 21:35
Computing the Equation Automaton of a Regular Expression in ,,) Space and Time,aton, called the equation automaton of .. The number of states in this automaton is less than or equal to the number of states in the position automaton. On the other hand, it can be computed by Antimirov’s algorithm with an ..) time complexity, whereas there exist ..) implementations for the positi作者: 共同確定為確 時(shí)間: 2025-3-24 02:07
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications,at our algorithm is crucial to the effective use of block-sorting compression, and we present a linear-time algorithm to sim- ulate the bottom-up traversal of a suffix tree with a suffix array combined with the longest common prefix information.作者: Gratuitous 時(shí)間: 2025-3-24 04:13
Multiple Pattern Matching Algorithms on Collage System,xt without decompression. Various algorithms have been proposed depending on underlying compression methods in the last decade. Although some algorithms for multipattern searching on compressed text were also presented very recently, all of them are only for Lempel-Ziv family compressions. In this p作者: COWER 時(shí)間: 2025-3-24 08:24
Finding All Common Intervals of , Permutations,lgorithm that finds in a family of . permutations of . elements all . common intervals in optimal . time and . additional space..This extends a result by Uno and Yagiura (. 26, 290-309, 2000) who present an algorithm to find all . common intervals of . = 2 permutations in optimal . time and . space.作者: 地殼 時(shí)間: 2025-3-24 11:22 作者: NOMAD 時(shí)間: 2025-3-24 16:20
Approximate Matching of Run-Length Compressed Strings,n of . letters (m0 runs) in a text of . letters (. runs) in . time, both for LCS and Levenshtein models. Then we propose improvements for a greedy algorithm for the LCS, and conjecture that the improved algorithm has . expected case complexity. Experimental results are provided to support the conjecture.作者: MELON 時(shí)間: 2025-3-24 22:45 作者: 粗糙 時(shí)間: 2025-3-25 02:14
Asim Anwar,Boon-Chong Seet,Xue Jun Li and manipulation of various graphs..Here we give the first completely elementary treatment of this problem. We characterize . and . working directly on the origi- nal signed permutation. Moreover, our presentation leads to polynomial algorithms that can be efficiently implemented using bit-wise operations.作者: Conspiracy 時(shí)間: 2025-3-25 05:55
Xin-tong Pei,Jian-jun Zeng,Zhen-jang Zhangf . tandem copies), and the alignment must include all of . and all of .. Our algorithm allows any alignment scoring scheme with . gap costs and runs in time .. We have used it to identify related tandem repeats in the .. . genome as part of the development of a multi-genome database of tandem repeats.作者: wall-stress 時(shí)間: 2025-3-25 10:46
Zhaonian Li,Changxiang Chen,ZhenJiang Zhang by Uno and Yagiura (. 26, 290-309, 2000) who present an algorithm to find all . common intervals of . = 2 permutations in optimal . time and . space. To achieve our result, we introduce the set of ., a generating subset of the set of all common intervals of . permutations.作者: 干涉 時(shí)間: 2025-3-25 12:26
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory, and manipulation of various graphs..Here we give the first completely elementary treatment of this problem. We characterize . and . working directly on the origi- nal signed permutation. Moreover, our presentation leads to polynomial algorithms that can be efficiently implemented using bit-wise operations.作者: 模范 時(shí)間: 2025-3-25 16:25 作者: BADGE 時(shí)間: 2025-3-25 23:30 作者: conference 時(shí)間: 2025-3-26 00:46
Lu Xu,Li Jianwei,Jiang Hao,Luo Dan,Cao Han the first nontrivial result for this problem. The experimental results show that our compressed search algorithm needs half the time necessary for decompression plus searching, which is currently the only alternative.作者: 時(shí)間等 時(shí)間: 2025-3-26 06:44
https://doi.org/10.1007/978-3-030-73562-3n of . letters (m0 runs) in a text of . letters (. runs) in . time, both for LCS and Levenshtein models. Then we propose improvements for a greedy algorithm for the LCS, and conjecture that the improved algorithm has . expected case complexity. Experimental results are provided to support the conjecture.作者: Cytokines 時(shí)間: 2025-3-26 10:12
https://doi.org/10.1007/978-3-031-31733-0by, but not exactly matched, can still be considered to be almost identical. We here define a “fuzzy Hamming distance” that extends the Hamming concept to give partial credit for near misses, and suggest a dynamic programming algorithm that permits it to be computed efficiently. We envision many uses for such a measure.作者: 爭論 時(shí)間: 2025-3-26 15:25
https://doi.org/10.1007/978-3-030-73562-3really simple to implement. We also extend the . to predict that a string could be a suffix (.. in the set ..::: ..) of .. We obtain the ., that enables in some cases a tricky improvement of the previous string matching algorithm.作者: 猛然一拉 時(shí)間: 2025-3-26 17:39 作者: 吵鬧 時(shí)間: 2025-3-26 21:42 作者: cushion 時(shí)間: 2025-3-27 01:26
Efficient Experimental String Matching by Weak Factor Recognition*,really simple to implement. We also extend the . to predict that a string could be a suffix (.. in the set ..::: ..) of .. We obtain the ., that enables in some cases a tricky improvement of the previous string matching algorithm.作者: 共同給與 時(shí)間: 2025-3-27 07:26
Better Filtering with Gapped q-Grams,rare and often pos- sess no apparent regularity. We show how to recognize good shapes and demonstrate with experiments their advantage over both contiguous and average shapes. We concentrate here on the . mismatches problem, but also outline an approach for extending the results to the more common . differences problem.作者: 完成才能戰(zhàn)勝 時(shí)間: 2025-3-27 10:57
Multiple Pattern Matching Algorithms on Collage System,sence of compressed pattern matching according to various dictionary based compressions. That is, we provide the model of multipattern matching algorithm for any compression method covered by the framework.作者: Culmination 時(shí)間: 2025-3-27 17:28
Diogo F. Lima Filho,José R. Amazonas related both to word and partial derivatives. This work is tightly connected to pattern matching area since the aim is, given a regular expression, to produce an as small as possible recognizer with the best space and time complexity.作者: ENNUI 時(shí)間: 2025-3-27 19:28 作者: 施舍 時(shí)間: 2025-3-28 01:16 作者: Musculoskeletal 時(shí)間: 2025-3-28 04:33 作者: Altitude 時(shí)間: 2025-3-28 09:56 作者: chuckle 時(shí)間: 2025-3-28 12:07 作者: inventory 時(shí)間: 2025-3-28 15:37
Chien Hung Wu,Rung Shiang Cheng,Chi Han Chen algorithm is .. + .. This is the first algorithm for motif discovery with a proven output sensitive complexity bound. The discovery algorithm works in two phases: in the first phase it detects a linear number of core motifs in time polynomial in the input size n and in the second phase it detects a作者: 補(bǔ)充 時(shí)間: 2025-3-28 20:42 作者: narcotic 時(shí)間: 2025-3-28 23:55
Lu Xu,Li Jianwei,Jiang Hao,Luo Dan,Cao Hanhe LZ78 and LZW variants. Given a text of length . compressed into length ., and a pattern of length ., we report all the . occurrences of the pattern in the text in .. + mn + Rmlogm) worst case time. On average this drops to .. + (n + R) logm) or O(m. + n+Ru=n) for most regular expressions. This is作者: Forehead-Lift 時(shí)間: 2025-3-29 03:53
https://doi.org/10.1007/978-3-030-73562-3rs is suggested and it is shown how LZSS and LZW can be adapted to take advantage of such parallel architectures. Experimental results show an improvement in compression and time over standard methods.作者: liaison 時(shí)間: 2025-3-29 07:42
https://doi.org/10.1007/978-3-030-73562-3the problem of computing the longest common subsequence (LCS) between two strings of length . and ., compressed to . and . runs. We extend an existing algorithm for the LCS to the Levenshtein distance achieving . complexity. This approach gives also an algorithm for approximate searching of a patter作者: Atmosphere 時(shí)間: 2025-3-29 13:21
Maggie Cheng,Peng Yu,Huibin Jiaon-chip memory start to diminish?.Parallel computing has been a strategic area of growth for computer science since the 1940s. So far, parallel computing affected main stream computer science only in a limited way. The key problem with parallel computers has been their programmability..The parallel 作者: 個人長篇演說 時(shí)間: 2025-3-29 18:58
https://doi.org/10.1007/978-3-030-73562-3 on a string ....... .. that acts like an oracle on the set of factors ..... ... If a string is recog- nized by this automaton, it may be a factor of .. But, if it is rejected, it is surely not a factor. We call it factor oracle. More precisely, this au- tomaton is acyclic, recognizes at least the f作者: Ventricle 時(shí)間: 2025-3-29 22:22 作者: Tempor 時(shí)間: 2025-3-30 00:13 作者: 親愛 時(shí)間: 2025-3-30 04:38
Wenye Wang,Fengzhe Dai,Fei Jiang,Zhichang Li= gcd(.). Here we study the case of long periods, namely ., for which we construct recursively a sequence of integers . ≥ 2, such that ., up to a certain prefix of ., has these numbers as periods. We further compute the maximum alphabet size . of A over which a word with long periods can exist, and 作者: seroma 時(shí)間: 2025-3-30 11:31
Asim Anwar,Boon-Chong Seet,Xue Jun Lirmutation. Their solution, as well as subsequent ones, relies on many intermediary constructions, such as simulations with permutations on . elements, and manipulation of various graphs..Here we give the first completely elementary treatment of this problem. We characterize . and . working directly 作者: 昏迷狀態(tài) 時(shí)間: 2025-3-30 14:12
Xin-tong Pei,Jian-jun Zeng,Zhen-jang Zhang. over all possible pairs ., for . = 1, 2,... and 1 ≤ . ≤ ., where . is the cyclic permutation of ., .. is the concatenation of . complete copies of . tandem copies), and the alignment must include all of . and all of .. Our algorithm allows any alignment scoring scheme with . gap costs and runs 作者: 帶子 時(shí)間: 2025-3-30 19:04 作者: miscreant 時(shí)間: 2025-3-30 22:22
Enhancing UORA for IEEE802.11beg., the case- based reasoning and the machine discovery. . are the most basic represen- tations of objects inside computers, and thus string similarity is one of the most important topics in computer science..Similarity measure must be sensitive to the kind of differences we wish to quantify. The . 作者: Kidnap 時(shí)間: 2025-3-31 03:05
Diogo F. Lima Filho,José R. Amazonasaton, called the equation automaton of .. The number of states in this automaton is less than or equal to the number of states in the position automaton. On the other hand, it can be computed by Antimirov’s algorithm with an ..) time complexity, whereas there exist ..) implementations for the positi作者: synovial-joint 時(shí)間: 2025-3-31 07:45 作者: Obliterate 時(shí)間: 2025-3-31 10:04 作者: 厭倦嗎你 時(shí)間: 2025-3-31 17:14 作者: Arresting 時(shí)間: 2025-3-31 19:12
Combinatorial Pattern Matching978-3-540-48194-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 津貼 時(shí)間: 2025-4-1 01:04 作者: Enthralling 時(shí)間: 2025-4-1 01:59
https://doi.org/10.1007/978-3-030-73562-3rs is suggested and it is shown how LZSS and LZW can be adapted to take advantage of such parallel architectures. Experimental results show an improvement in compression and time over standard methods.
