找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: 可入到
发表于 2025-3-23 11:29:09 | 显示全部楼层
发表于 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.
发表于 2025-3-23 19:23:26 | 显示全部楼层
发表于 2025-3-23 22:19:53 | 显示全部楼层
Open Problems in StringologySeveral open problems concerning combinatorial algorithms on strings are described.
发表于 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.
发表于 2025-3-24 07:29:37 | 显示全部楼层
发表于 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].
发表于 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.
发表于 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.
发表于 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.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-5 01:11
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表