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

Inf. Process. Lett.最新文献

筛选
英文 中文
Approximating weighted neighborhood independent sets 逼近加权邻域独立集
Inf. Process. Lett. Pub Date : 2018-02-01 DOI: 10.1016/j.ipl.2017.09.014
Min Chih Lin, Julián Mestre, S. Vasiliev
{"title":"Approximating weighted neighborhood independent sets","authors":"Min Chih Lin, Julián Mestre, S. Vasiliev","doi":"10.1016/j.ipl.2017.09.014","DOIUrl":"https://doi.org/10.1016/j.ipl.2017.09.014","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"23 1","pages":"11-15"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84703443","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
Stream VByte: Faster byte-oriented integer compression Stream VByte:更快的面向字节的整数压缩
Inf. Process. Lett. Pub Date : 2017-09-25 DOI: 10.1016/j.ipl.2017.09.011
D. Lemire, Nathan Kurz, Christoph Rupp
{"title":"Stream VByte: Faster byte-oriented integer compression","authors":"D. Lemire, Nathan Kurz, Christoph Rupp","doi":"10.1016/j.ipl.2017.09.011","DOIUrl":"https://doi.org/10.1016/j.ipl.2017.09.011","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"19 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91532892","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}
引用次数: 38
Source-wise round-trip spanners 基于源的往返扳手
Inf. Process. Lett. Pub Date : 2017-08-01 DOI: 10.1016/j.ipl.2017.04.009
Chun Jiang Zhu, K. Lam
{"title":"Source-wise round-trip spanners","authors":"Chun Jiang Zhu, K. Lam","doi":"10.1016/j.ipl.2017.04.009","DOIUrl":"https://doi.org/10.1016/j.ipl.2017.04.009","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"51 1","pages":"42-45"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79946859","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}
引用次数: 6
Integer codes correcting single errors and burst asymmetric errors within a byte 整数码纠正单个错误和字节内的突发不对称错误
Inf. Process. Lett. Pub Date : 2017-05-01 DOI: 10.1016/j.ipl.2017.01.010
A. Radonjić, V. Vujicic
{"title":"Integer codes correcting single errors and burst asymmetric errors within a byte","authors":"A. Radonjić, V. Vujicic","doi":"10.1016/j.ipl.2017.01.010","DOIUrl":"https://doi.org/10.1016/j.ipl.2017.01.010","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"36 1","pages":"45-50"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75334462","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}
引用次数: 6
On the parameterized complexity of the Edge Monitoring problem 边缘监控问题的参数化复杂度研究
Inf. Process. Lett. Pub Date : 2017-05-01 DOI: 10.1016/j.ipl.2017.01.008
Julien Baste, F. Beggas, H. Kheddouci, Ignasi Sau
{"title":"On the parameterized complexity of the Edge Monitoring problem","authors":"Julien Baste, F. Beggas, H. Kheddouci, Ignasi Sau","doi":"10.1016/j.ipl.2017.01.008","DOIUrl":"https://doi.org/10.1016/j.ipl.2017.01.008","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"13 1","pages":"39-44"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85124346","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}
引用次数: 7
A note on path embedding in crossed cubes with faulty vertices 带有错误顶点的交叉立方体中路径嵌入的注释
Inf. Process. Lett. Pub Date : 2017-05-01 DOI: 10.1016/j.ipl.2017.01.006
Hon-Chan Chen, Yun-Hao Zou, Yue-Li Wang, Kung-Jui Pai
{"title":"A note on path embedding in crossed cubes with faulty vertices","authors":"Hon-Chan Chen, Yun-Hao Zou, Yue-Li Wang, Kung-Jui Pai","doi":"10.1016/j.ipl.2017.01.006","DOIUrl":"https://doi.org/10.1016/j.ipl.2017.01.006","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"46 12","pages":"34-38"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91427699","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}
引用次数: 8
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs 适当区间图中最大基数切割问题的多项式时间算法
Inf. Process. Lett. Pub Date : 2017-05-01 DOI: 10.1016/j.ipl.2017.01.007
Arman Boyaci, T. Ekim, M. Shalom
{"title":"A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs","authors":"Arman Boyaci, T. Ekim, M. Shalom","doi":"10.1016/j.ipl.2017.01.007","DOIUrl":"https://doi.org/10.1016/j.ipl.2017.01.007","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"135 1","pages":"29-33"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87909612","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}
引用次数: 13
A note on non-splitting Z-bent functions 关于非分裂z弯曲函数的注释
Inf. Process. Lett. Pub Date : 2017-05-01 DOI: 10.1016/j.ipl.2017.01.001
S. Gangopadhyay, E. Pasalic, P. Stănică, Saral Datta
{"title":"A note on non-splitting Z-bent functions","authors":"S. Gangopadhyay, E. Pasalic, P. Stănică, Saral Datta","doi":"10.1016/j.ipl.2017.01.001","DOIUrl":"https://doi.org/10.1016/j.ipl.2017.01.001","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"38 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74527905","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}
引用次数: 1
Improved approximation algorithms for k-connected m-dominating set problems k连通m支配集问题的改进逼近算法
Inf. Process. Lett. Pub Date : 2017-03-13 DOI: 10.1016/j.ipl.2018.08.003
Zeev Nutov
{"title":"Improved approximation algorithms for k-connected m-dominating set problems","authors":"Zeev Nutov","doi":"10.1016/j.ipl.2018.08.003","DOIUrl":"https://doi.org/10.1016/j.ipl.2018.08.003","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"31 1","pages":"30-33"},"PeriodicalIF":0.0,"publicationDate":"2017-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84272612","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}
引用次数: 6
Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine 在单台无界机器上最小化总加权完成时间的在线并行批调度
Inf. Process. Lett. Pub Date : 2016-08-01 DOI: 10.1016/j.ipl.2016.03.010
Yang Fang, Xiwen Lu
{"title":"Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine","authors":"Yang Fang, Xiwen Lu","doi":"10.1016/j.ipl.2016.03.010","DOIUrl":"https://doi.org/10.1016/j.ipl.2016.03.010","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"40 1","pages":"526-531"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90516655","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
首页 上一页 下一页 尾页
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学术官方微信