CAREER: New Methods for Central Streaming Problems
CAREER: New Methods for Central Streaming Problems
批准号:
2244899
负责人:
Vladimir Braverman
金额:
$50.0万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2022
资助国家:
美国
项目状态:
已结题
起止时间:
2022-07-01 至 2024-01-31
中文摘要
点击翻译按钮获取中文摘要
英文摘要
The streaming model is a powerful model of computation that has made a significant impact on computer science over the past decade. Recent developments demonstrate the critical need for streaming methods in numerous applications such as networking, machine learning, astronomy and statistical inference. The project will develop new streaming and sketching algorithms that will be applicable in the aforementioned areas. The project will support undergraduate research and engage students in working on cutting-edge theoretical problems. The project will promote STEM education by collaborating with Independence School Local 1 (IHS), a public charter high school in Baltimore city, where minority students constitute about 60 percent of the student body. This project will help to organize (I) a workshop for first generation students and (II) an annual Sublinear Algorithms Workshop at Johns Hopkins University. The project will promote core education and will introduce new advanced courses and seminars that will convey the principles of algorithms to non-theory students.In 1996, Alon, Matias and Szegedy published a fundamental paper on streaming algorithms. The paper introduced the problem of approximating frequency moments in the streaming model and asked the open question, ?What other frequency-based functions can be approximated on streams?? Since 1996 the research on data streams has resulted in great progress. Despite this progress, our understanding of many fundamental streaming problems is far from being complete. The main technical objective of this project is to develop new algorithms that will resolve central problems and overcome existing barriers of streaming methods. The specific goals are the following: (1) Answer the main open question of Alon, Matias and Szegedy and obtain a zero-one law for all frequency-based functions. (2) Discover the relation between the sliding window model and the unbounded model. Extend this knowledge to the decay and distributed models. (3) Design new sampling methods for data streams. Extend the sampling methods for the sliding window model to decay models, improve the weighted and distributed sampling.
期刊论文(4)
专著(0)
科研奖励(0)
会议论文
Universal Streaming of Subset Norms
子集规范的通用流式传输
DOI:
10.4086/toc.2022.v018a020
发表时间:
2022
期刊:
Theory of Computing
影响因子:
1
作者:
[Braverman, Vladimir, Krauthgamer, Robert, Yang, Lin F.]
通讯作者:
Yang, Lin F.
DOI:
--
发表时间:
2023
期刊:
Leibniz international proceedings in informatics
影响因子:
--
作者:
[Braverman, V., Krauthgamer, R., Krishnan, A., Sapir, S.]
通讯作者:
Sapir, S.
DOI:
10.1145/3519935.3520009
发表时间:
2021-04
期刊:
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
影响因子:
--
作者:
[V. Braverman;A. Krishnan;Christopher Musco]
通讯作者:
V. Braverman;A. Krishnan;Christopher Musco
Collaborative Research: CNS: Medium: Scalable Learning from Distributed Data for Wireless Network Management
-
批准号:2333887
-
项目类别:Continuing Grant
-
资助金额:$19.99万
-
财政年份:2022
-
负责人:Vladimir Braverman
-
依托单位:
CSR: NeTS: Small: In-Network Resource Management for Rack-Scale Computers
-
批准号:2244870
-
项目类别:Standard Grant
-
资助金额:$50.0万
-
财政年份:2022
-
负责人:Vladimir Braverman
-
依托单位:
Collaborative Research: CNS: Medium: Scalable Learning from Distributed Data for Wireless Network Management
-
批准号:2107239
-
项目类别:Continuing Grant
-
资助金额:$19.99万
-
财政年份:2021
-
负责人:Vladimir Braverman
-
依托单位:
CSR: NeTS: Small: In-Network Resource Management for Rack-Scale Computers
-
批准号:1813487
-
项目类别:Standard Grant
-
资助金额:$50.0万
-
财政年份:2018
-
负责人:Vladimir Braverman
-
依托单位:
CAREER: New Methods for Central Streaming Problems
-
批准号:1652257
-
项目类别:Continuing Grant
-
资助金额:$50.0万
-
财政年份:2017
-
负责人:Vladimir Braverman
-
依托单位:
EAGER: Universal Sketches for Network Monitoring
-
批准号:1650041
-
项目类别:Standard Grant
-
资助金额:$10.0万
-
财政年份:2016
-
负责人:Vladimir Braverman
-
依托单位:
BIGDATA: F: DKA: Collaborative Research: Clustering Algorithms for Data Streams
-
批准号:1447639
-
项目类别:Standard Grant
-
资助金额:$100.0万
-
财政年份:2014
-
负责人:Vladimir Braverman
-
依托单位:
海外基金