Communications of the ACM最新文献_第10页

Serverless Computing: What It Is, and What It Is Not? 无服务器计算:它是什么，它不是什么?

IF 22.7 3区计算机科学

Communications of the ACM Pub Date : 2023-08-23 DOI: 10.1145/3587249

Samuel Kounev, N. Herbst, Cristina L. Abad, A. Iosup, Ian T Foster, P. Shenoy, O. Rana, A. Chien

引用次数: 1

Distilling What We Know 提炼我们所知道的

IF 22.7 3区计算机科学

Communications of the ACM Pub Date : 2023-08-23 DOI: 10.1145/3607891

Samuel Greengard

引用次数: 0

How Many Ways Can You Teach a Robot? 你能教机器人几种方法？

IF 22.7 3区计算机科学

Communications of the ACM Pub Date : 2023-08-23 DOI: 10.1145/3608109

L. Hoffmann

引用次数: 0

Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough 历史算法帮助解锁最短路径问题突破

IF 22.7 3区计算机科学

Communications of the ACM Pub Date : 2023-08-23 DOI: 10.1145/3607866

C. Edwards

引用次数: 0

Cargo Cult AI 货物崇拜AI

IF 22.7 3区计算机科学

Communications of the ACM Pub Date : 2023-08-23 DOI: 10.1145/3606946

E. Levine

引用次数: 0

Coming of Age 成年的到来

3区计算机科学

Communications of the ACM Pub Date : 2023-08-23 DOI: 10.1145/3608965

Stefano Zanero

引用次数: 0

Humble AI

IF 22.7 3区计算机科学

Communications of the ACM Pub Date : 2023-08-23 DOI: 10.1145/3587035

Bran Knowles, J. D’cruz, John T. Richards, Kush R. Varshney

引用次数: 1

Tapping the Link between Algorithmic Model Counting and Streaming: Technical Perspective 挖掘算法模型计数和流媒体之间的联系:技术视角

IF 22.7 3区计算机科学

Communications of the ACM Pub Date : 2023-08-23 DOI: 10.1145/3607825

David P. Woodruff

{"title":"Tapping the Link between Algorithmic Model Counting and Streaming: Technical Perspective","authors":"David P. Woodruff","doi":"10.1145/3607825","DOIUrl":"https://doi.org/10.1145/3607825","url":null,"abstract":"algorithms for F0 estimation to algorithms for model counting. The authors also show a partial converse, namely, by framing F0 estimation as a special case of model counting, the authors obtain a very general algorithm for F0 estimation and variants. The resulting algorithms can be used to select a minimum cost query plan in database design and are also a key tool for detecting denial-of-service attacks in network monitoring. The starting point of the paper is the observation that a hashing-based technique for model counting1,3 uses the same techniques as an F0 estimation data stream algorithm.2 The idea behind both is to reduce the counting problem to a detection problem. For model counting, one chooses random subsets of possible solutions of geometrically varying size and checks if there is any satisfying assignment to φ in each subset. For F0 estimation in data streams, one chooses random subsets of universe items of geometrically varying size and checks if there is an item in one’s subset that occurs in the stream. In both cases, by finding the size of the smallest set for which there is a satisfying assignment (for model counting) or an element occurring in the stream (for F0 estimation), one can scale back up by the reciprocal of that set’s size to obtain a decent approximation to the number of solutions (for model counting) or number of distinct elements (for data streams).","PeriodicalId":10594,"journal":{"name":"Communications of the ACM","volume":" ","pages":"94 - 94"},"PeriodicalIF":22.7,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48742293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Rebutting Rebuttals 反驳反驳

IF 22.7 3区计算机科学

Communications of the ACM Pub Date : 2023-08-23 DOI: 10.1145/3584664

N. Dershowitz, Rakesh M. Verma

引用次数: 3

Model Counting Meets Distinct Elements 模型计数遇到不同元素

IF 22.7 3区计算机科学

Communications of the ACM Pub Date : 2023-08-23 DOI: 10.1145/3607824

A. Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel

{"title":"Model Counting Meets Distinct Elements","authors":"A. Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel","doi":"10.1145/3607824","DOIUrl":"https://doi.org/10.1145/3607824","url":null,"abstract":"Constraint satisfaction problems (CSPs) and data stream models are two powerful abstractions to capture a wide variety of problems arising in different domains of computer science. Developments in the two communities have mostly occurred independently and with little interaction between them. In this work, we seek to investigate whether bridging the seeming communication gap between the two communities may pave the way to richer fundamental insights. To this end, we focus on two foundational problems: model counting for CSPs and the computation of the number of distinct elements in a data stream, also known as the zeroth frequency moment (F0) of a data stream. Our investigations lead us to observe striking similarity in the core techniques employed in the algorithmic frameworks that have evolved separately for model counting and distinct elements computation. We design a recipe for the translation of algorithms developed for distinct elements estimation to that of model counting, resulting in new algorithms for model counting. We then observe that algorithms in the context of distributed streaming can be transformed into distributed algorithms for model counting. We next turn our attention to viewing streaming from the lens of counting and show that framing distinct elements estimation as a special case of #DNF counting allows us to obtain a general recipe for a rich class of streaming problems, which had been subjected to case-specific analysis in prior works.","PeriodicalId":10594,"journal":{"name":"Communications of the ACM","volume":"66 1","pages":"95 - 102"},"PeriodicalIF":22.7,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44547282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0