找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Algorithms; 25th International W Kratochvíl Jan,Mirka Miller,Dalibor Froncek Conference proceedings 2015 Springer Internation

[复制链接]
楼主: 相似
发表于 2025-4-1 05:53:37 | 显示全部楼层
发表于 2025-4-1 08:24:23 | 显示全部楼层
Computing Primitively-Rooted Squares and Runs in Partial Words,s a sequence that may have undefined positions, called holes or wildcards, that match any letter of the alphabet over which the sequence is defined. We also describe an algorithm for computing all primitively-rooted runs in a given partial word.
发表于 2025-4-1 13:32:48 | 显示全部楼层
发表于 2025-4-1 16:23:18 | 显示全部楼层
Timothy O’Riordan,Ray Kemp,Michael Purdue techniques. In this paper we propose a novel entropy based security measure that can be applied to any generalisation, restriction or data modification technique. We use our measure to empirically evaluate and compare a few popular methods, namely query restriction, sampling and noise addition.
发表于 2025-4-1 19:17:50 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-24 15:34
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表