Výsledky vyhledávání - sublinear AND near linear time algorithms phrases Streaming algorithms~

Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

Autoři: Chien-Chung Huang François Sellier Huang, Chien-Chung

Přispěvatelé: Chien-Chung Huang François Sellier Huang, Chien-Chung

Zdroj: Algorithmica. 86:3598-3628

Témata: FOS: Computer and information sciences, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, sublinear and near linear time algorithms, 0211 other engineering and technologies, 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 2012 ACM Subject Classification Theory of computation → Streaming, matchoid, 01 natural sciences, Computer Science - Data Structures and Algorithms, matroid, Data Structures and Algorithms (cs.DS), streaming, submodular function maximization

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2107.13071
https://hal.science/hal-03982431v1

Sliding Window Property Testing for Regular Languages

Autoři: Ganardi, Moses Hucke, Danny Lohrey, Markus a další

Přispěvatelé: Ganardi, Moses Hucke, Danny Lohrey, Markus a další

Zdroj: 30th International Symposium on Algorithms and Computation (ISAAC 2019)
https://hal.science/hal-03942948
30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019, ShangHai, China. ⟨10.4230/LIPIcs.ISAAC.2019.6⟩

Témata: 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms phrases Streaming algorithms approximation algorithms regular languages, 2012 ACM Subject Classification Theory of computation → Streaming, sublinear and near linear time algorithms phrases Streaming algorithms, approximation algorithms, regular languages, [INFO]Computer Science [cs]

Geografické téma: ShangHai, China

Relation: hal-03942948; https://hal.science/hal-03942948; https://hal.science/hal-03942948/document; https://hal.science/hal-03942948/file/LIPIcs-ISAAC-2019-6.pdf

Dostupnost: https://hal.science/hal-03942948
https://hal.science/hal-03942948/document
https://hal.science/hal-03942948/file/LIPIcs-ISAAC-2019-6.pdf
https://doi.org/10.4230/LIPIcs.ISAAC.2019.6

Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

Autoři: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) a další

Přispěvatelé: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) a další

Zdroj: APPROX/RANDOM ; https://hal.science/hal-03982431 ; APPROX/RANDOM, Aug 2021, Seattle, United States

Témata: 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, 2012 ACM Subject Classification Theory of computation → Streaming, sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, submodular function maximization, streaming, matroid, matchoid, [INFO]Computer Science [cs]

Geografické téma: Seattle, United States

Dostupnost: https://hal.science/hal-03982431
https://hal.science/hal-03982431v1/document
https://hal.science/hal-03982431v1/file/2107.13071.pdf

Enhancing Data Compression: Recent Innovations in LZ77 Algorithms.

Autoři: Hong, Aaron Boucher, Christina

Zdroj: Journal of Computational Biology; Aug2025, Vol. 32 Issue 8, p761-780, 20p

Optimizing Offer Sets in Sub-Linear Time.

Autoři: FARIAS, VIVEK F. LI, ANDREW A. SINHA, DEEKSHA

Zdroj: EC: Economics & Computation; 2020, p639-640, 2p

Témata: COMMERCIAL products, MANUFACTURED products, ALGORITHMS, MACHINE theory, ECONOMICS, SOCIAL sciences

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.

Autoři: Dong, Sally Gao, Yu Goranci, Gramoz a další

Zdroj: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-75, 75p

Témata: PLANAR graphs, INTERIOR-point methods, SPARSE graphs, ALGORITHMS, DATA structures, FLUID flow, TIME complexity

Vertex Connectivity in Poly-logarithmic Max-Flows.

Autoři: Li, Jason Nanongkai, Danupon Panigrahi, Debmalya a další

Zdroj: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-34, 34p

Témata: GRAPH connectivity, COMPUTATIONAL complexity, DIRECTED graphs, ALGORITHMS, UNDIRECTED graphs

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.

Autoři: Bhattacharya, Sayan Kiss, Peter Saranurak, Thatchaphol a další

Zdroj: Journal of the ACM; Oct2024, Vol. 71 Issue 5, p1-32, 32p

Témata: GRAPH algorithms, OPEN-ended questions, ALGORITHMS

RANGE (RÉNYI) ENTROPY QUERIES AND PARTITIONING.

Autoři: ESMAILPOUR, ARYAN KRISHNAN, SANJAY SINTOS, STAVROS

Zdroj: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 4, p17:1-17:49, 49p

Streaming Algorithms for Geometric Steiner Forest.

Autoři: Czumaj, Artur Jiang, Shaofeng H.-C. Krauthgamer, Robert a další

Zdroj: ACM Transactions on Algorithms; Oct2024, Vol. 20 Issue 4, p1-38, 38p

Témata: COST estimates, OPEN-ended questions, GENERALIZATION, ALGORITHMS, MEMORY

A Framework for Adversarially Robust Streaming Algorithms.

Autoři: BEN-ELIEZER, OMRI JAYARAM, RAJESH WOODRUFF, DAVID P. a další

Zdroj: Journal of the ACM; Mar2022, Vol. 69 Issue 2, p1-33, 33p

Témata: DETERMINISTIC algorithms, ALGORITHMS

Sketching Approximability of All Finite CSPs.

Autoři: Chou, Chi-Ning Golovnev, Alexander Sudan, Madhu a další

Zdroj: Journal of the ACM; Apr2024, Vol. 71 Issue 2, p1-74, 74p

Témata: CONSTRAINT satisfaction, BOOLEAN functions, SEPARATION of variables, FOURIER analysis, APPROXIMATION algorithms, COMMUNICATION barriers, HYPERCUBES

A Linear-Time n^0.4-Approximation for Longest Common Subsequence.

Autoři: BRINGMANN, KARL COHEN-ADDAD, VINCENT DAS, DEBARATI

Zdroj: ACM Transactions on Algorithms; Jan2023, Vol. 19 Issue 1, p1-24, 24p

Témata: APPROXIMATION algorithms, DYNAMIC programming, COMMUNITIES, EXPECTATION-maximization algorithms

Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time.

Autoři: CHAKRABORTY, DIPTARKA DAS, DEBARATI GOLDENBERG, ELAZAR a další

Zdroj: Journal of the ACM; 2020, Vol. 67 Issue 6, p1-22, 22p

Témata: DISTANCES, DYNAMIC programming, APPROXIMATION algorithms

Counting Subgraphs in Degenerate Graphs.

Autoři: BERA, SUMAN K. GISHBOLINER, LIOR LEVANZOV, YEVGENY a další

Zdroj: Journal of the ACM; May2022, Vol. 69 Issue 3, p1-21, 21p

Témata: PLANAR graphs, COUNTING, STOCHASTIC processes, CHARTS, diagrams, etc., HOMOMORPHISMS, GRAPH algorithms, PROBLEM solving, SUBGRAPHS

Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance.

Autoři: Gudmundsson, Joachim Seybold, Martin P. Wong, Sampson

Zdroj: ACM Transactions on Algorithms; Apr2024, Vol. 20 Issue 2, p1-33, 33p

Témata: DATA structures, POLYNOMIAL time algorithms, PLANAR graphs, GRAPH algorithms, APPROXIMATION algorithms, MATCHING theory, COMPUTATIONAL geometry

Towards Optimal Moment Estimation in Streaming and Distributed Models.

Autoři: JAYARAM, RAJESH WOODRUFF, DAVID P.

Zdroj: ACM Transactions on Algorithms; Jul2023, Vol. 19 Issue 3, p1-35, 35p

Témata: MATRIX multiplications, DISTRIBUTED algorithms, TOPOLOGY, MESSAGE passing (Computer science), DATA modeling

Tolerant Testers of Image Properties.

Autoři: BERMAN, PIOTR MURZABULATOV, MEIRAM RASKHODNIKOVA, SOFYA

Zdroj: ACM Transactions on Algorithms; Nov2022, Vol. 18 Issue 4, p1-39, 39p

Témata: APPROXIMATION algorithms, IMAGE processing, CONVEX sets, DYNAMIC programming, MATHEMATICAL connectedness, COMPUTATIONAL geometry, POLYGONS

Delegating Computation: Interactive Proofs for Muggles.

Autoři: GOLDWASSER, SHAFI KALAI, YAEL TAUMAN ROTHBLUM, GUY N.

Zdroj: Journal of the ACM; Aug2015, Vol. 62 Issue 4, p1-64, 64p

Témata: POLYNOMIAL time algorithms, COMPUTATIONAL complexity, ALGORITHMS, COMPUTABLE functions, THEORY

CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams.

Autoři: KIJUNG SHIN EUIWOONG LEE HAMMOUD, MOHAMMAD a další

Zdroj: ACM Transactions on Knowledge Discovery from Data; Apr2021, Vol. 15 Issue 3, p1-30, 30p

Témata: DISTRIBUTED algorithms, TRIANGLES, ANOMALY detection (Computer security), COUNTING, UNBIASED estimation (Statistics)