找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Combinatorial Algorithms on Words; Alberto Apostolico,Zvi Galil Conference proceedings 1985 Springer-Verlag Berlin Heidelberg 1985 Area.Co

[復(fù)制鏈接]
樓主: 可入到
11#
發(fā)表于 2025-3-23 11:29:09 | 只看該作者
12#
發(fā)表于 2025-3-23 14:57:05 | 只看該作者
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.
13#
發(fā)表于 2025-3-23 19:23:26 | 只看該作者
14#
發(fā)表于 2025-3-23 22:19:53 | 只看該作者
Open Problems in StringologySeveral open problems concerning combinatorial algorithms on strings are described.
15#
發(fā)表于 2025-3-24 05:30:20 | 只看該作者
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.
16#
發(fā)表于 2025-3-24 07:29:37 | 只看該作者
17#
發(fā)表于 2025-3-24 14:02:55 | 只看該作者
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].
18#
發(fā)表于 2025-3-24 16:23:49 | 只看該作者
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.
19#
發(fā)表于 2025-3-24 21:34:43 | 只看該作者
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.
20#
發(fā)表于 2025-3-25 02:32:52 | 只看該作者
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.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-7 20:44
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
项城市| 旌德县| 乡宁县| 五莲县| 保山市| 新化县| 玛沁县| 比如县| 南昌市| 达尔| 南皮县| 恩施市| 缙云县| 任丘市| 寻甸| 图木舒克市| 陈巴尔虎旗| 蓬溪县| 略阳县| 青川县| 宝山区| 株洲市| 峨山| 唐山市| 进贤县| 抚州市| 临高县| 左权县| 延吉市| 海丰县| 沅陵县| 荔浦县| 汤阴县| 营山县| 丹寨县| 正宁县| 类乌齐县| 延庆县| 彰化县| 新泰市| 临江市|