咨询与建议

限定检索结果

文献类型

  • 56 篇 期刊文献
  • 53 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 110 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 88 篇 工学
    • 80 篇 计算机科学与技术...
    • 18 篇 电气工程
    • 13 篇 信息与通信工程
    • 9 篇 软件工程
    • 2 篇 仪器科学与技术
    • 1 篇 电子科学与技术(可...
    • 1 篇 控制科学与工程
    • 1 篇 石油与天然气工程
    • 1 篇 生物医学工程(可授...
    • 1 篇 网络空间安全
  • 46 篇 理学
    • 41 篇 数学
    • 2 篇 系统科学
    • 2 篇 统计学(可授理学、...
    • 1 篇 物理学
    • 1 篇 生物学
  • 20 篇 管理学
    • 19 篇 管理科学与工程(可...
    • 5 篇 工商管理
    • 1 篇 公共管理
  • 7 篇 经济学
    • 6 篇 应用经济学
    • 1 篇 理论经济学
  • 2 篇 法学
    • 1 篇 法学
    • 1 篇 社会学
  • 2 篇 医学
    • 2 篇 基础医学(可授医学...

主题

  • 110 篇 streaming algori...
  • 14 篇 approximation al...
  • 11 篇 integer lattice
  • 8 篇 submodular maxim...
  • 7 篇 communication co...
  • 6 篇 cardinality cons...
  • 5 篇 randomized algor...
  • 4 篇 knapsack constra...
  • 4 篇 non-submodular m...
  • 4 篇 influence maximi...
  • 4 篇 parallel algorit...
  • 4 篇 principal compon...
  • 3 篇 credit distribut...
  • 3 篇 clustering
  • 3 篇 k-submodular
  • 3 篇 dimension reduct...
  • 3 篇 big data
  • 3 篇 online algorithm
  • 3 篇 non-submodular
  • 3 篇 scientific liter...

机构

  • 6 篇 beijing univ tec...
  • 5 篇 shandong jianzhu...
  • 5 篇 ocean univ china...
  • 4 篇 weifang univ sch...
  • 3 篇 princeton univ p...
  • 3 篇 univ calif davis...
  • 2 篇 school of mathem...
  • 2 篇 princeton univ d...
  • 2 篇 beijing univ tec...
  • 2 篇 qilu univ techno...
  • 2 篇 chinese acad sci...
  • 2 篇 natl univ singap...
  • 2 篇 phenikaa univ fa...
  • 2 篇 rutgers state un...
  • 2 篇 univ calif berke...
  • 2 篇 yahool inc yahoo...
  • 2 篇 univ chinese aca...
  • 2 篇 qingdao univ sch...
  • 2 篇 beijing institut...
  • 2 篇 keio univ yokoha...

作者

  • 6 篇 guo longkun
  • 5 篇 zhang dongmei
  • 5 篇 xu dachuan
  • 5 篇 liu bin
  • 4 篇 cui shuguang
  • 4 篇 tan jingjing
  • 4 篇 yu qilian
  • 3 篇 ha dung k. t.
  • 3 篇 chen zihan
  • 3 篇 zhang zhenning
  • 3 篇 yang ruiqi
  • 3 篇 yoon myungkeun
  • 3 篇 wang yanhao
  • 2 篇 zou juan
  • 2 篇 donglei du
  • 2 篇 li li
  • 2 篇 qilian yu
  • 2 篇 wang yijing
  • 2 篇 chen k
  • 2 篇 nguyen bich-ngan...

语言

  • 108 篇 英文
  • 2 篇 其他
检索条件"主题词=Streaming Algorithm"
110 条 记 录,以下是101-110 订阅
排序:
Multiple pass streaming algorithms for learning mixtures of distributions in Rd
收藏 引用
THEORETICAL COMPUTER SCIENCE 2009年 第19期410卷 1765-1780页
作者: Chang, Kevin L. Yahool Inc Yahool Labs Sunnyvale CA 94089 USA
We present a multiple pass streaming algorithm for learning the density function of a mixture of k uniform distributions over rectangles in R-d, for any d > 0. Our learning model is: samples drawn according to the ... 详细信息
来源: 评论
Multiple pass streaming algorithms for learning mixtures of distributions in Rd
Multiple pass streaming algorithms for learning mixtures of ...
收藏 引用
18th International Conference on algorithmic Learning Theory
作者: Chang, Kevin L. Yahool Inc Yahool Labs Sunnyvale CA 94089 USA
We present a multiple pass streaming algorithm for learning the density function of a mixture of k uniform distributions over rectangles in R-d, for any d > 0. Our learning model is: samples drawn according to the ... 详细信息
来源: 评论
Development of an HL7 interface engine, based on tree structure and streaming algorithm, for large-size messages which include image
收藏 引用
COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE 2005年 第2期80卷 126-140页
作者: Um, KS Kwak, YS Cho, H Kim, IK NCI Ctr Bioinformat NIH Rockville MD 20852 USA Kyungpook Natl Univ Sch Med Dept Med Informat Taegu 700422 South Korea
A basic assumption of Health Level Seven (HL7) protocol is 'No limitation of message length'. However, most existing commercial HL7 interface engines do limit message length because they use the string array m... 详细信息
来源: 评论
Real-Time Detection of Invisible Spreaders
Real-Time Detection of Invisible Spreaders
收藏 引用
IEEE Global Telecommunications Conference (GLOBECOM 08)
作者: Yoon, MyungKeun Chen, Shigang Univ Florida Dept Comp & Informat Sci & Engn Gainesville FL 32611 USA
Detecting spreaders can help an intrusion detection system identify potential attackers. The existing work can only detect aggressive spreaders that scan a large number of distinct addresses in a short period of time.... 详细信息
来源: 评论
Estimating Cardinality Distributions in Network Traffic
Estimating Cardinality Distributions in Network Traffic
收藏 引用
International Conference on Measurement and Modeling of Computer Systems
作者: Chen, Aiyou Li, Li Cao, Jin Bell Labs Alcatel Lucent Technol Murray Hill NJ 07974 USA
Information on network host, connectivity patterns are important for network monitoring and traffic engineering. In this paper, all efficient streaming algorithm is proposed to estimate cardinality distributions inclu... 详细信息
来源: 评论
Estimating cardinality distributions in network traffic: extended abstract  08
Estimating cardinality distributions in network traffic: ext...
收藏 引用
Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
作者: Aiyou Chen Li Li Jin Cao Bell Labs Alcatel-Lucent Technologies Murray Hill NJ USA
Information on network host connectivity patterns are important for network monitoring and traffic engineering. In this paper, an efficient streaming algorithm is proposed to estimate cardinality distributions includi... 详细信息
来源: 评论
Analysis of data streams: Computational and algorithmic challenges
收藏 引用
TECHNOMETRICS 2007年 第3期49卷 346-356页
作者: Gilbert, A. C. Strauss, M. J. Univ Michigan Dept Math Ann Arbor MI 48109 USA
Over the past 15 years, our ability to collect massive data sets has increased dramatically. Concomitantly, our need to process, compress, store, analyze, and summarize these data sets has grown as well. Scientific, e... 详细信息
来源: 评论
Finding frequent items in data streams
收藏 引用
THEORETICAL COMPUTER SCIENCE 2004年 第1期312卷 3-15页
作者: Charikar, M Chen, K Farach-Colton, M Princeton Univ Dept Comp Sci Princeton NJ 08544 USA Univ Calif Berkeley Div Comp Sci Berkeley CA 94720 USA Rutgers State Univ Dept Comp Sci Piscataway NJ 08855 USA
We present a I-pass algorithm for estimating the most frequent items in a data stream using limited storage space. Our method relies on a data structure called a COUNT SKETCH, which allows us to reliably estimate the ... 详细信息
来源: 评论
Finding frequent items in data streams
收藏 引用
29th International Colloquium on Automata, Languages and Programming
作者: Charikar, M Chen, K Farach-Colton, M Princeton Univ Dept Comp Sci Princeton NJ 08544 USA Univ Calif Berkeley Div Comp Sci Berkeley CA 94720 USA Rutgers State Univ Dept Comp Sci Piscataway NJ 08855 USA
We present a I-pass algorithm for estimating the most frequent items in a data stream using limited storage space. Our method relies on a data structure called a COUNT SKETCH, which allows us to reliably estimate the ... 详细信息
来源: 评论
Better streaming algorithms for clustering problems  03
Better streaming algorithms for clustering problems
收藏 引用
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
作者: Moses Charikar Liadan O'Callaghan Rina Panigrahy Princeton University Stanford University Cisco Systems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storage space. Our main result is a randomiz... 详细信息
来源: 评论