標(biāo)題: Titlebook: Combinatorial Algorithms on Words; Alberto Apostolico,Zvi Galil Conference proceedings 1985 Springer-Verlag Berlin Heidelberg 1985 Area.Co [打印本頁(yè)] 作者: 可入到 時(shí)間: 2025-3-21 18:18
書(shū)目名稱Combinatorial Algorithms on Words影響因子(影響力)
書(shū)目名稱Combinatorial Algorithms on Words影響因子(影響力)學(xué)科排名
書(shū)目名稱Combinatorial Algorithms on Words網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Combinatorial Algorithms on Words網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Combinatorial Algorithms on Words被引頻次
書(shū)目名稱Combinatorial Algorithms on Words被引頻次學(xué)科排名
書(shū)目名稱Combinatorial Algorithms on Words年度引用
書(shū)目名稱Combinatorial Algorithms on Words年度引用學(xué)科排名
書(shū)目名稱Combinatorial Algorithms on Words讀者反饋
書(shū)目名稱Combinatorial Algorithms on Words讀者反饋學(xué)科排名
作者: prosperity 時(shí)間: 2025-3-21 22:35 作者: insurrection 時(shí)間: 2025-3-22 03:04
https://doi.org/10.1007/978-3-030-24857-4f each others, In this paper we show that automata theory unifies the two approaches and sives a simple and efficient alsorithm to construct the structure, a sequential transducer, underlyins Weiner’s method.作者: 流眼淚 時(shí)間: 2025-3-22 06:19
Skeletal Development and Repair zero-block runs are represented. The basis elements of these systems, together with the non-zero blocks, are assigned Huffman codes. Experiments run on bit-maps of the Responsa Retrieval Project, and for comparison on randomly generated maps and on a digitized picture, yield compressions superior to previously known methods.作者: fulcrum 時(shí)間: 2025-3-22 11:39
https://doi.org/10.1007/978-1-0716-1028-2l group theory, compression of sparse binary strings, encoding of contiguous binary strings of unknown lengths, ranking of permutations and combinations, strategies of games and other examples. Two abstract counting systems are given from which the concrete ones used for the applications can be derived.作者: groggy 時(shí)間: 2025-3-22 15:39
Tadafumi Kawamoto,Komei Kawamoto). Various applications to comma-free codes, games, pattern matching, and other subjects are indicated. The emphasis is on the unified treatment of those topics through the use of generating functions.作者: groggy 時(shí)間: 2025-3-22 19:41
https://doi.org/10.1007/978-981-99-5679-1 deals with a “natural” object — the size of the transitive closure of a random mapping. In the second problem certain contrived combinatorial objects are counted in two different ways in order to devise a new class of Abelian identities.作者: 明智的人 時(shí)間: 2025-3-22 21:48 作者: Colonoscopy 時(shí)間: 2025-3-23 03:13 作者: Derogate 時(shí)間: 2025-3-23 09:28 作者: Arthr- 時(shí)間: 2025-3-23 11:29 作者: flaggy 時(shí)間: 2025-3-23 14:57
Natural Disease May Mimic Child Abuse,A clean version of Weiner’s linear-time compact-subword-tree construction simultaneously also constructs the smallest deterministic finite automaton recognizing the . subwords.作者: helper-T-cells 時(shí)間: 2025-3-23 19:23 作者: TSH582 時(shí)間: 2025-3-23 22:19
Open Problems in StringologySeveral open problems concerning combinatorial algorithms on strings are described.作者: Constitution 時(shí)間: 2025-3-24 05:30
The Myriad Virtues of Subword TreesSeveral nontrivial applications of subword trees have been developed since their first appearance. Some such applications depart considerably from the original motivations. A brief account of them is attempted here.作者: TAP 時(shí)間: 2025-3-24 07:29 作者: Permanent 時(shí)間: 2025-3-24 14:02
Optimal Parsing of StringsParsing of strings has been suggested by Lempel and Ziv, as a tool to define the complexity of strings [LZ1] and to compress them [ZL1, ZL2]. Recently, they have shown that the scheme may be modified to handle two dimensional data [LZ2].作者: temperate 時(shí)間: 2025-3-24 16:23
Optimal Factor Transducersf each others, In this paper we show that automata theory unifies the two approaches and sives a simple and efficient alsorithm to construct the structure, a sequential transducer, underlyins Weiner’s method.作者: Chagrin 時(shí)間: 2025-3-24 21:34
Novel Compression of Sparse Bit-Strings — Preliminary Report zero-block runs are represented. The basis elements of these systems, together with the non-zero blocks, are assigned Huffman codes. Experiments run on bit-maps of the Responsa Retrieval Project, and for comparison on randomly generated maps and on a digitized picture, yield compressions superior to previously known methods.作者: Incisor 時(shí)間: 2025-3-25 02:32
The Use and Usefulness of Numeration Systemsl group theory, compression of sparse binary strings, encoding of contiguous binary strings of unknown lengths, ranking of permutations and combinations, strategies of games and other examples. Two abstract counting systems are given from which the concrete ones used for the applications can be derived.作者: Individual 時(shí)間: 2025-3-25 03:45 作者: 創(chuàng)造性 時(shí)間: 2025-3-25 09:07 作者: 慷慨援助 時(shí)間: 2025-3-25 13:48
https://doi.org/10.1007/978-3-030-24857-4 Aho and Corasick [AC] independently solved the problem for patterns consisting of a set of strings, where the occurrence of one member is considered a match. Both algorithms preprocess the pattern so that the text can be searched efficiently. This paper considers the extension of their methods to, 作者: Creditee 時(shí)間: 2025-3-25 18:56
https://doi.org/10.1007/978-3-030-24857-4f each others, In this paper we show that automata theory unifies the two approaches and sives a simple and efficient alsorithm to construct the structure, a sequential transducer, underlyins Weiner’s method.作者: 有限 時(shí)間: 2025-3-25 21:24 作者: TERRA 時(shí)間: 2025-3-26 03:51 作者: expire 時(shí)間: 2025-3-26 04:57
Beta-Galactosidase Staining in the Skeletonamounts of processing power on a single chip promises to make sophisticated data compression algorithms truly practical. A data encoding/decoding chip can be placed at the ends of every communication channel, with no computational overhead incurred by the communicating processes. Similarly, secondar作者: 適宜 時(shí)間: 2025-3-26 08:54
Sys Hasslund,Regis J. O’Keefe,Hani A. Awadof the encoding tables to a fixed size. The improvements are in the area of dispensing with any uncompressed output, ability to use fixed size encoding tables by using a replacement strategy, and more rapid adaptation by widening the class of strings which may be added to the dictionary. Following L作者: 金桌活畫(huà)面 時(shí)間: 2025-3-26 16:13 作者: GORGE 時(shí)間: 2025-3-26 17:06
Skeletal Development and Repair zero-block runs are represented. The basis elements of these systems, together with the non-zero blocks, are assigned Huffman codes. Experiments run on bit-maps of the Responsa Retrieval Project, and for comparison on randomly generated maps and on a digitized picture, yield compressions superior t作者: 偽造 時(shí)間: 2025-3-26 21:23 作者: 個(gè)人長(zhǎng)篇演說(shuō) 時(shí)間: 2025-3-27 04:16 作者: 炸壞 時(shí)間: 2025-3-27 07:24
https://doi.org/10.1007/978-981-99-5679-1 deals with a “natural” object — the size of the transitive closure of a random mapping. In the second problem certain contrived combinatorial objects are counted in two different ways in order to devise a new class of Abelian identities.作者: 公司 時(shí)間: 2025-3-27 13:03 作者: 愛(ài)管閑事 時(shí)間: 2025-3-27 15:06 作者: Concerto 時(shí)間: 2025-3-27 21:05 作者: 勤勞 時(shí)間: 2025-3-28 00:08 作者: triptans 時(shí)間: 2025-3-28 04:21
Strategies, Challenges, and Change-Making,of this paper is to elaborate on this observation and to present a detailed and accurate average-case analysis of both the brute-force and the KMP algorithm. The analysis exploits results from Markov chain theory. This approach is believed to be practically sound, since string matching can be modeled conveniently by finite-state devices.作者: 沒(méi)有貧窮 時(shí)間: 2025-3-28 08:47 作者: Bother 時(shí)間: 2025-3-28 12:54
Beta-Galactosidase Staining in the Skeletonforming a string of characters to another (presumable shorter) string, from which it is possible to recover (exactly) the original string at some point later in time. This paper surveys research on data compression methods that employ textual substitution.作者: HILAR 時(shí)間: 2025-3-28 15:26
Relating the Average-Case Costs of the Brute-Force and Knuth-Morris-Pratt String Matching Algorithmof this paper is to elaborate on this observation and to present a detailed and accurate average-case analysis of both the brute-force and the KMP algorithm. The analysis exploits results from Markov chain theory. This approach is believed to be practically sound, since string matching can be modeled conveniently by finite-state devices.作者: 共同時(shí)代 時(shí)間: 2025-3-28 21:54 作者: 進(jìn)步 時(shí)間: 2025-3-28 23:29 作者: Tinea-Capitis 時(shí)間: 2025-3-29 04:02 作者: 神刊 時(shí)間: 2025-3-29 07:36
Optimal Factor Transducersf each others, In this paper we show that automata theory unifies the two approaches and sives a simple and efficient alsorithm to construct the structure, a sequential transducer, underlyins Weiner’s method.作者: Genteel 時(shí)間: 2025-3-29 13:28 作者: 口訣 時(shí)間: 2025-3-29 18:33
Algorithms for Factorizing and Testing Subsemigroupss properties. The properties we consider are that . be a uniquely decipherable, a finitely decipherable, a synchronizable, or a prefix code. The algorithm for constructing the uniquely decipherable and the finitely decipherable code . requires .(... + ..) steps, the algorithm for constructing the sy作者: neuron 時(shí)間: 2025-3-29 22:44 作者: 通便 時(shí)間: 2025-3-30 02:26 作者: podiatrist 時(shí)間: 2025-3-30 07:13 作者: aspect 時(shí)間: 2025-3-30 08:54 作者: 不透明性 時(shí)間: 2025-3-30 15:25 作者: FLEET 時(shí)間: 2025-3-30 20:33 作者: Obsequious 時(shí)間: 2025-3-30 21:48 作者: 桉樹(shù) 時(shí)間: 2025-3-31 03:04 作者: 口訣法 時(shí)間: 2025-3-31 05:28
0258-1248 e felt that it would be advantageous to both current and future researchers to collect this work in a sin- gle reference. It should be clear that the book‘s emp978-3-642-82458-6978-3-642-82456-2Series ISSN 0258-1248 作者: 陶瓷 時(shí)間: 2025-3-31 10:33
https://doi.org/10.1007/978-3-030-24857-4n the text, using the algorithm of Aho and Corasick [AC]. We arrange the consequences of the intermediate results of the search in an array of small counters whose length is equal to that of the pattern. As soon as a match for the whole pattern is found, it is reported. If we assume that the counter作者: Terrace 時(shí)間: 2025-3-31 14:31
Skeletal Development and Repairnes for different pictures, the constructive coding theorem leads to a universal compression-scheme that is asymptotically optimal for every picture. The results of this paper are readily extendable to data arrays of any finite dimension. The proofs of the theorems will appear in a forthcoming paper作者: 支柱 時(shí)間: 2025-3-31 20:51
Efficient String Matching with Don’t-Care Patternsn the text, using the algorithm of Aho and Corasick [AC]. We arrange the consequences of the intermediate results of the search in an array of small counters whose length is equal to that of the pattern. As soon as a match for the whole pattern is found, it is reported. If we assume that the counter作者: 發(fā)芽 時(shí)間: 2025-3-31 22:10
