CORC  > 上海电子信息职业技术学院
Bounded-Degree Connected Approximations of Stochastic Networks
NegarKiyavash; ChristopherJ.Quinn; AliPinar
刊名IEEE Transactions on Molecular, Biological and Multi-Scale Communications
2017
卷号Vol.3 No.2页码:79-88
关键词Approximation algorithms Heuristic algorithms Visualization Biology Complexity theory Electronic mail Laboratories Probabilistic graphical models network inference time-series analysis information theory algorithms
URL标识查看原文
公开日期[db:dc_date_available]
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/5380966
专题上海电子信息职业技术学院
作者单位1.School of Industrial Engineering, Purdue University, West Lafayette, IN, USA
2.Data Science and Cyber Analytics Department, Sandia National Laboratories, Livermore, CA, USA
3.Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana, IL, USA
推荐引用方式
GB/T 7714
NegarKiyavash,ChristopherJ.Quinn,AliPinar. Bounded-Degree Connected Approximations of Stochastic Networks[J]. IEEE Transactions on Molecular, Biological and Multi-Scale Communications,2017,Vol.3 No.2:79-88.
APA NegarKiyavash,ChristopherJ.Quinn,&AliPinar.(2017).Bounded-Degree Connected Approximations of Stochastic Networks.IEEE Transactions on Molecular, Biological and Multi-Scale Communications,Vol.3 No.2,79-88.
MLA NegarKiyavash,et al."Bounded-Degree Connected Approximations of Stochastic Networks".IEEE Transactions on Molecular, Biological and Multi-Scale Communications Vol.3 No.2(2017):79-88.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace