咨询与建议

限定检索结果

文献类型

  • 109 篇 会议
  • 106 篇 期刊文献
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 201 篇 工学
    • 191 篇 计算机科学与技术...
    • 39 篇 软件工程
    • 35 篇 电气工程
    • 7 篇 信息与通信工程
    • 6 篇 控制科学与工程
    • 1 篇 仪器科学与技术
    • 1 篇 动力工程及工程热...
    • 1 篇 电子科学与技术(可...
    • 1 篇 石油与天然气工程
    • 1 篇 环境科学与工程(可...
    • 1 篇 生物医学工程(可授...
  • 88 篇 理学
    • 86 篇 数学
    • 3 篇 物理学
    • 3 篇 统计学(可授理学、...
    • 2 篇 系统科学
    • 1 篇 生物学
  • 9 篇 管理学
    • 9 篇 管理科学与工程(可...
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 217 篇 streaming algori...
  • 14 篇 approximation al...
  • 12 篇 communication co...
  • 11 篇 algorithms
  • 9 篇 submodular maxim...
  • 9 篇 heavy hitters
  • 8 篇 clustering
  • 8 篇 theory
  • 8 篇 online algorithm...
  • 8 篇 lower bounds
  • 8 篇 randomized algor...
  • 6 篇 graph partitioni...
  • 6 篇 graph algorithms
  • 6 篇 sketches
  • 6 篇 data streams
  • 6 篇 sampling
  • 5 篇 distinct element...
  • 5 篇 triangle countin...
  • 5 篇 set cover
  • 5 篇 quantiles

机构

  • 10 篇 carnegie mellon ...
  • 5 篇 charles univ pra...
  • 4 篇 mit cambridge ma...
  • 4 篇 harvard univ sch...
  • 4 篇 johns hopkins un...
  • 4 篇 univ warwick cov...
  • 3 篇 indian stat inst...
  • 3 篇 univ nebraska li...
  • 3 篇 univ penn philad...
  • 3 篇 univ waterloo sc...
  • 3 篇 xi an jiao tong ...
  • 3 篇 tel aviv univ te...
  • 3 篇 natl univ singap...
  • 3 篇 univ penn dept c...
  • 2 篇 weizmann inst sc...
  • 2 篇 alan turing inst...
  • 2 篇 georgetown univ ...
  • 2 篇 peking univ peop...
  • 2 篇 univ michigan an...
  • 2 篇 sandia natl labs...

作者

  • 12 篇 woodruff david p...
  • 9 篇 braverman vladim...
  • 9 篇 cormode graham
  • 7 篇 vesely pavel
  • 7 篇 zhou samson
  • 6 篇 assadi sepehr
  • 6 篇 khanna sanjeev
  • 6 篇 velusamy santhos...
  • 5 篇 sudan madhu
  • 5 篇 wang pinghui
  • 5 篇 chou chi-ning
  • 4 篇 golovnev alexand...
  • 4 篇 meel kuldeep s.
  • 4 篇 czumaj artur
  • 4 篇 bender michael a...
  • 4 篇 farach-colton ma...
  • 4 篇 vinodchandran n....
  • 4 篇 indyk piotr
  • 4 篇 guan xiaohong
  • 4 篇 hernandez cecili...

语言

  • 214 篇 英文
  • 2 篇 其他
  • 1 篇 中文
检索条件"主题词=Streaming algorithms"
217 条 记 录,以下是151-160 订阅
排序:
Near Optimal Linear Algebra in the Online and Sliding Window Models  61
Near Optimal Linear Algebra in the Online and Sliding Window...
收藏 引用
61st IEEE Annual Symposium on Foundations of Computer Science (FOCS)
作者: Braverman, Vladimir Drineas, Petros Musco, Cameron Musco, Christopher Upadhyay, Jalaj Woodruff, David P. Zhou, Samson Johns Hopkins Univ Baltimore MD 21218 USA Purdue Univ W Lafayette IN 47907 USA Univ Massachusetts Amherst Amherst MA USA NYU New York NY 10003 USA Apple Cupertino CA USA Carnegie Mellon Univ Pittsburgh PA 15213 USA
We initiate the study of numerical linear algebra in the sliding window model, where only the most recent W updates in a stream form the underlying data set. Although many existing algorithms in the sliding window mod... 详细信息
来源: 评论
Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization  64
Derandomization vs Refutation: A Unified Framework for Chara...
收藏 引用
64th Annual IEEE Symposium on the Foundations of Computer Science (FOCS)
作者: Chen, Lijie Tell, Roei Williams, Ryan Univ Calif Berkeley Miller Inst Bas Res Sci Berkeley CA 94720 USA Univ Toronto Dept Comp Sci Toronto ON Canada MIT EECS Cambridge MA 02139 USA
We establish an equivalence between two algorithmic tasks: derandomization, the deterministic simulation of probabilistic algorithms;and refutation, the deterministic construction of inputs on which a given probabilis... 详细信息
来源: 评论
Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams  1
收藏 引用
3rd International Conference on algorithms and Discrete Applied Mathematics (CALDAM)
作者: Braverman, Vladimir Lang, Harry Levin, Keith Johns Hopkins Univ Dept Comp Sci Baltimore MD 21218 USA Johns Hopkins Univ Dept Math Baltimore MD 21218 USA
We present a low-constant approximation for metric k median on an insertion-only stream of n points using 0O(epsilon(-3)k log n) space. In particular, we present a streaming (0(epsilon(-3)k log n), 2 + 6)-bicriterion ... 详细信息
来源: 评论
Weak Lower Bounds on Resource-Bounded Compression Imply Strong Separations of Complexity Classes  2019
Weak Lower Bounds on Resource-Bounded Compression Imply Stro...
收藏 引用
51st Annual ACM SIGACT Symposium on Theory of Computing (STOC)
作者: McKay, Dylan M. Murray, Cody D. Williams, R. Ryan MIT CSAIL Cambridge MA 02139 USA MIT EECS Cambridge MA 02139 USA
The Minimum Circuit Size Problem (MCSP) asks to determine the minimum size of a circuit computing a given truth table. MCSP is a natural and powerful string compression problem whose NP-hardness remains open. Recently... 详细信息
来源: 评论
Quancurrent: A Concurrent Quantiles Sketch  23
Quancurrent: A Concurrent Quantiles Sketch
收藏 引用
35th ACM Symposium on Parallelism in algorithms and Architectures (SPAA)
作者: Zada, Shaked Elias Rinberg, Arik Keidar, Idit Technion Haifa Israel
Sketches are a family of streaming algorithms widely used in the world of big data to perform fast, real-time analytics. A popular sketch type is Quantiles, which estimates the data distribution of a large input strea... 详细信息
来源: 评论
Small Space Representations for Metric Min-sum k-Clustering and Their Applications
收藏 引用
24th Annual Symposium on Theoretical Aspects of Computer Science
作者: Czumaj, Artur Sohler, Christian Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England Univ Warwick Ctr Discrete Math & Applicat Coventry CV4 7AL W Midlands England TU Dortmund Dept Comp Sci D-44221 Dortmund Germany
The min-sum k-clustering problem is to partition a metric space ( P, d) into k clusters C-1,..., C-k subset of P such that Sigma(k)(i=1) Sigma(p,q is an element of Ci) d(p, q) is minimized. We show the first efficient... 详细信息
来源: 评论
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance  11
K-Median Clustering, Model-Based Compressive Sensing, and Sp...
收藏 引用
43rd ACM Symposium on Theory of Computing
作者: Indyk, Piotr Price, Eric MIT CSAIL Cambridge MA 02139 USA
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m x n matrices A such that for any x, given Ax, we can recover a k-sparse approximati... 详细信息
来源: 评论
Hierarchical Clustering in Graph Streams: Single-Pass algorithms and Space Lower Bounds  35
Hierarchical Clustering in Graph Streams: Single-Pass Algori...
收藏 引用
35th Conference on Learning Theory (COLT)
作者: Assadi, Sepehr Chatziafratis, Vaggos Lacki, Jakub Mirrokni, Vahab Wang, Chen Rutgers State Univ Piscataway NJ 08854 USA Univ Calif Santa Cruz Santa Cruz CA 95064 USA Google Res New York NY USA
The Hierarchical Clustering (HC) problem consists of building a hierarchy of clusters to represent a given dataset. Motivated by the modern large-scale applications, we study the problem in the streaming model, in whi... 详细信息
来源: 评论
Finding Favourite Tuples on Data Streams with Provably Few Comparisons  23
Finding Favourite Tuples on Data Streams with Provably Few C...
收藏 引用
29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
作者: Zhang, Guangyi Tatti, Nikolaj Gionis, Aristides Shenzhen Inst Comp Sci Shenzhen Peoples R China Univ Helsinki HIIT Helsinki Finland KTH Royal Inst Technol Stockholm Sweden
One of the most fundamental tasks in data science is to assist a user with unknown preferences in finding high-utility tuples within a large database. To accurately elicit the unknown user preferences, a widely-adopte... 详细信息
来源: 评论
Volume and Irregularity Effects on Massively Multicore Packet Processors  18
Volume and Irregularity Effects on Massively Multicore Packe...
收藏 引用
18th Asia-Pacific Network Operations and Management Symposium (APNOMS)
作者: Zhanikeev, Marat Tokyo Univ Sci Sch Management Chiyoda Ku Fujimi 1-11-2 Tokyo 1020071 Japan
Irregularity is a recognized problem on many-and multi-core platforms but its effect remains to be studied. This paper focuses on multicore processors and assumes that packet traffic is processed by a large number of ... 详细信息
来源: 评论