发布求助
文献互助 智能选刊 最新文献

Inf. Process. Lett.最新文献

筛选
英文 中文
Strong security of linear ramp secret sharing schemes with general access structures 具有一般访问结构的线性斜坡秘密共享方案的强安全性
Inf. Process. Lett. Pub Date : 2020-08-05 DOI: 10.1016/j.ipl.2020.106018
Reo Eriguchi, N. Kunihiro
{"title":"Strong security of linear ramp secret sharing schemes with general access structures","authors":"Reo Eriguchi, N. Kunihiro","doi":"10.1016/j.ipl.2020.106018","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.106018","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"2013 1","pages":"106018"},"PeriodicalIF":0.0,"publicationDate":"2020-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87725650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Robbins and Ardila meet Berstel 罗宾斯和阿迪拉遇见了贝尔斯特尔
Inf. Process. Lett. Pub Date : 2020-07-29 DOI: 10.1016/j.ipl.2020.106081
J. Shallit
{"title":"Robbins and Ardila meet Berstel","authors":"J. Shallit","doi":"10.1016/j.ipl.2020.106081","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.106081","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"3 1","pages":"106081"},"PeriodicalIF":0.0,"publicationDate":"2020-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80536484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Lot scheduling on a single machine to minimize the (weighted) number of tardy orders 在一台机器上进行批量调度，以尽量减少延迟订单的(加权)数量
Inf. Process. Lett. Pub Date : 2020-07-21 DOI: 10.1016/j.ipl.2020.106009
Baruch Mor, G. Mosheiov, Dana Shapira
{"title":"Lot scheduling on a single machine to minimize the (weighted) number of tardy orders","authors":"Baruch Mor, G. Mosheiov, Dana Shapira","doi":"10.1016/j.ipl.2020.106009","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.106009","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"95 1","pages":"106009"},"PeriodicalIF":0.0,"publicationDate":"2020-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86084993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer 用于发现癌症中突变驱动通路的连接最大覆盖问题的近似算法
Inf. Process. Lett. Pub Date : 2020-06-01 DOI: 10.1016/j.ipl.2020.105940
D. Hochbaum, Xu Rao
{"title":"Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer","authors":"D. Hochbaum, Xu Rao","doi":"10.1016/j.ipl.2020.105940","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.105940","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"47 1","pages":"105940"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85892618","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
On ideal semicomplete digraphs 关于理想半完全有向图
Inf. Process. Lett. Pub Date : 2020-05-01 DOI: 10.1016/j.ipl.2019.105903
Han Xiao
{"title":"On ideal semicomplete digraphs","authors":"Han Xiao","doi":"10.1016/j.ipl.2019.105903","DOIUrl":"https://doi.org/10.1016/j.ipl.2019.105903","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"2 1","pages":"105903"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86546409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Variational networks of cube-connected cycles are recursive cubes of rings 立方连接环的变分网络是环的递归立方
Inf. Process. Lett. Pub Date : 2020-05-01 DOI: 10.1016/j.ipl.2020.105925
I. A. Stewart
{"title":"Variational networks of cube-connected cycles are recursive cubes of rings","authors":"I. A. Stewart","doi":"10.1016/j.ipl.2020.105925","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.105925","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"157 1","pages":"105925"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85220252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
2-Dimensional Palindromes with k Mismatches 2-Dimensional Palindromes with k Mismatches
Inf. Process. Lett. Pub Date : 2020-02-25 DOI: 10.1016/j.ipl.2020.106019
Dina Sokol
{"title":"2-Dimensional Palindromes with k Mismatches","authors":"Dina Sokol","doi":"10.1016/j.ipl.2020.106019","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.106019","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"36 1","pages":"106019"},"PeriodicalIF":0.0,"publicationDate":"2020-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89831492","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
New bounds on antipowers in words 对反大国的新限制
Inf. Process. Lett. Pub Date : 2019-12-17 DOI: 10.1016/j.ipl.2020.106021
Lukas Fleischer, S. Riasat, J. Shallit
{"title":"New bounds on antipowers in words","authors":"Lukas Fleischer, S. Riasat, J. Shallit","doi":"10.1016/j.ipl.2020.106021","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.106021","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"100 1","pages":"106021"},"PeriodicalIF":0.0,"publicationDate":"2019-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80370302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Statistical EL is ExpTime-complete 统计EL是ExpTime-complete
Inf. Process. Lett. Pub Date : 2019-11-02 DOI: 10.1016/J.IPL.2021.106113
Bartosz Bednarczyk
{"title":"Statistical EL is ExpTime-complete","authors":"Bartosz Bednarczyk","doi":"10.1016/J.IPL.2021.106113","DOIUrl":"https://doi.org/10.1016/J.IPL.2021.106113","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"63 1","pages":"106113"},"PeriodicalIF":0.0,"publicationDate":"2019-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91254189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On semi-supervised active clustering of stable instances with oracles 基于oracle的稳定实例半监督主动聚类
Inf. Process. Lett. Pub Date : 2019-11-01 DOI: 10.1016/J.IPL.2019.105833
Deepayan Sanyal, Swagatam Das
{"title":"On semi-supervised active clustering of stable instances with oracles","authors":"Deepayan Sanyal, Swagatam Das","doi":"10.1016/J.IPL.2019.105833","DOIUrl":"https://doi.org/10.1016/J.IPL.2019.105833","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"14 2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90458327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信