咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是191-200 订阅
排序:
The Frequent Items Problem in Online streaming Under Various Performance Measures
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2015年 第4期26卷 413-439页
作者: Boyar, Joan Larsen, Kim S. Maiti, Abyayananda Univ Southern Denmark Dept Math & Comp Sci DK-5230 Odense M Denmark
This is a contribution to the ongoing study of properties of perform nose measures for online algorithms. It has long been known that competitive analysis suffers from drawbacks in certain situations, and many alterna... 详细信息
来源: 评论
Mergeable summaries  12
Mergeable summaries
收藏 引用
31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '12
作者: Agarwal, Pankaj K. Cormode, Graham Huang, Zengfeng Phillips, Jeff Wei, Zhewei Yi, Ke Duke University Durham NC United States AT and T Labs.-Research United States HKUST Hong Kong Hong Kong University of Utah Salt Lake City UT United States
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into a single summary on the union of the t... 详细信息
来源: 评论
Approximating Semi-matchings in streaming and in Two-Party Communication
收藏 引用
ACM TRANSACTIONS ON algorithms 2016年 第3期12卷 32-32页
作者: Konrad, Christian Rosen, Adi Reykjavik Univ Sch Comp Sci Dept Comp Sci Menntavegur 1 IS-101 Reykjavik Iceland Univ Paris 07 IRIF Case 7014 F-75205 Paris 13 France
We study the streaming complexity and communication complexity of approximating unweighted semi-matchings. A semi-matching in a bipartite graph G = (A, B, E) with n = vertical bar A vertical bar is a subset of edges S... 详细信息
来源: 评论
Truly Perfect Samplers for Data Streams and Sliding Windows  22
Truly Perfect Samplers for Data Streams and Sliding Windows
收藏 引用
41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS)
作者: Jayaram, Rajesh Woodruff, David P. Zhou, Samson Carnegie Mellon Univ Pittsburgh PA 15213 USA
In the G-sampling problem, the goal is to output an index i of a vector f is an element of R-n, such that for all coordinates j is an element of [n], Pr[i = j] = (1 +/- epsilon) G(f(j))/Sigma(k is an element of[n]) G(... 详细信息
来源: 评论
TIGHT BOUNDS FOR SINGLE-PASS streaming COMPLEXITY OF THE SET COVER PROBLEM
收藏 引用
SIAM JOURNAL ON COMPUTING 2021年 第3期50卷 STOC16-341-STOC16-376页
作者: Assadi, Sepehr Khanna, Sanjeev Li, Yang Univ Penn Dept Comp & Informat Sci Philadelphia PA 19104 USA
We resolve the space complexity of single-pass streaming algorithms for approximating the classic set cover problem. For finding an alpha-approximate set cover (for any alpha = o(root n/ log n)) using a single-pass st... 详细信息
来源: 评论
Tracking the 2 norm with constant update time  22
Tracking the 2 norm with constant update time
收藏 引用
22nd International Conference on Approximation algorithms for Combinatorial Optimization Problems and 23rd International Conference on Randomization and Computation, APPROX/RANDOM 2019
作者: Chou, Chi-Ning Lei, Zhixian Nakkiran, Preetum School of Engineering and Applied Sciences Harvard University CambridgeMA United States
The 2 tracking problem is the task of obtaining a streaming algorithm that, given access to a stream of items a1, a2, a3, . . . from a universe [n], outputs at each time t an estimate to the 2 norm of the frequency ve... 详细信息
来源: 评论
Computing k centers over streaming data for small k
收藏 引用
International Journal of Computational Geometry and Applications 2014年 第2期24卷 107-123页
作者: Ahn, Hee-Kap Kim, Hyo-Sil Kim, Sang-Sub Son, Wanbin Department of Computer Science and Engineering POSTECH Pohang South Korea
In this paper, we consider the k-center problem for streaming points in Rd. More precisely, we consider the single-pass streaming model, where each point in the stream is allowed to be examined only once and a small a... 详细信息
来源: 评论
GRAPHZEPPELIN: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams  22
GRAPHZEPPELIN: Storage-Friendly Sketching for Connected Comp...
收藏 引用
International Conference on Management of Data (SIGMOD)
作者: Tench, David West, Evan Zhang, Victor Bender, Michael A. Chowdhury, Abiyaz Dellas, J. Ahmed Farach-Colton, Martin Seip, Tyler Zhang, Kenny Rutgers State Univ New Brunswick NJ 08901 USA SUNY Stony Brook Stony Brook NY 11794 USA MongoDB New York NY USA
Finding the connected components of a graph is a fundamental problem with uses throughout computer science and engineering. The task of computing connected components becomes more difficult when graphs are very large,... 详细信息
来源: 评论
Sparsifying Count Sketch
收藏 引用
INFORMATION PROCESSING LETTERS 2024年 186卷
作者: Verma, Bhisham Dev Pratap, Rameshwar Dubey, Punit Pankaj Indian Inst Technol Mandi Mandi Himachal Prades India Indian Inst Technol Hyderabad Hyderabad Telangana India
The seminal work of Charikar et al. [1] called COUNT-SKETCH suggests a sketching algorithm for real-valued vectors that has been used in frequency estimation for data streams and pairwise inner product estimation for ... 详细信息
来源: 评论
Timely Reporting of Heavy Hitters Using External Memory
收藏 引用
ACM TRANSACTIONS ON DATABASE SYSTEMS 2021年 第4期46卷 14-14页
作者: Singh, Shikha Pandey, Prashant Bender, Michael A. Berry, Jonathan W. Farach-Colton, Martin Johnson, Rob Kroeger, Thomas M. Phillips, Cynthia A. Williams Coll Dept Comp Sci Williamstown MA 01267 USA VMware Res 3425 Hillview Ave Palo Alto CA 94304 USA SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA Sandia Natl Labs Mailstop 1327POB 5800 Albuquerque NM 87185 USA Rutgers State Univ Dept Comp Sci Piscataway NJ 08854 USA
Given an input stream S of size N, a phi-heavy hitter is an item that occurs at least phi N times in S. The problem of finding heavy-hitters is extensively studied in the database literature. We study a real-time heav... 详细信息
来源: 评论