Výsledky vyhledávání - sublinear and near linear time algorithms phrases testing algorithms

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

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

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

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time.

Autoři: Chen, Li Kyng, Rasmus Liu, Yang a další

Zdroj: Journal of the ACM; Jun2025, Vol. 72 Issue 3, p1-103, 103p

Témata: DIRECTED acyclic graphs, DATA structures, INTERIOR-point methods, ISOTONIC regression, FLOWGRAPHS

Fast and Perfect Sampling of Subgraphs and Polymer Systems.

Autoři: Blanca, Antonio Cannon, Sarah Perkins, Will

Zdroj: ACM Transactions on Algorithms; Jan2024, Vol. 20 Issue 1, p1-30, 30p

Témata: SUBGRAPHS, BIPARTITE graphs, WEIGHTED graphs, LOW temperatures, PERCOLATION

An investigation of camera movements and capture techniques on optical flow for real-time rendering and presentation.

Autoři: Modi, Nishant Ramakrishna, M.

Zdroj: Journal of Real-Time Image Processing; Aug2023, Vol. 20 Issue 4, p1-15, 15p

Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms.

Autoři: Levinson, Howard W. Markel, Vadim Triantafillou, Nicholas

Zdroj: SIAM Journal on Imaging Sciences; 2023, Vol. 16 Issue 3, p1338-1369, 32p

The Smoothed Complexity of Edit Distance.

Autoři: Andoni, Alexandr Krauthgamer, Robert

Zdroj: ACM Transactions on Algorithms; 2012, Vol. 8 Issue 4, p1-25, 25p

Témata: COMPUTATIONAL complexity, SEQUENCE alignment, MATHEMATICAL models, ALGORITHMS, PERMUTATIONS, APPROXIMATION theory, MATHEMATICAL bounds

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

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

Better Sum Estimation via Weighted Sampling.

Autoři: Beretta, Lorenzo Tětek, Jakub

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

Témata: SPARSE graphs, GRAPH algorithms, BIN packing problem, 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

Twin-width I: Tractable FO Model Checking.

Autoři: BONNET, ÉDOUARD EUN JUNG KIM THOMASSÉ, STÉPHAN a další

Zdroj: Journal of the ACM; Jan2022, Vol. 69 Issue 1, p3-46, 46p

Témata: POLYNOMIAL time algorithms, PARTIALLY ordered sets, UNIT ball (Mathematics), CHARTS, diagrams, etc., GENETIC transduction

People: MARX, Karl, 1818-1883

Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes.

Autoři: Fomin, Fedorr V. Lokshtanov, Daniel Saurabh, Saket

Zdroj: Journal of the ACM; Jan2018, Vol. 65 Issue 2, p1-44, 44p

Témata: POLYNOMIAL time algorithms, APPROXIMATION theory, PLANAR graphs, GRAPH theory, MATHEMATICS theorems

Faster Property Testers in a Variation of the Bounded Degree Model.

Autoři: ADLER, ISOLDE FAHEY, POLLY

Zdroj: ACM Transactions on Computational Logic; Jul2023, Vol. 24 Issue 3, p1-24, 24p

Témata: RELATIONAL databases, HYPERGRAPHS

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

Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits.

Autoři: Pettie, Seth Ramachandran, Vijaya

Zdroj: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 1, p5:1-5:27, 27p, 1 Diagram, 5 Charts

Témata: SPANNING trees, ALGORITHMS, LINEAR systems, TREE graphs, ALGEBRA

Triangulation and Embedding Using Small Sets of Beacons.

Autoři: KLEINBERG, JON SLIVKINS, ALEKSANDRS WEXLER, TOM

Zdroj: Journal of the ACM; Sep2009, Vol. 56 Issue 6, p32-32:37, 37p, 2 Diagrams

Témata: TRIANGULATION, EMBEDDINGS (Mathematics), DISTRIBUTED algorithms, METRIC spaces, INTERNET, MATRICES (Mathematics)

Clustering under Approximation Stability.

Autoři: BALCAN, MARIA-FLORINA BLUM, AVRIM GUPTA, ANUPAM

Zdroj: Journal of the ACM; Apr2013, Vol. 60 Issue 2, p8-8:34, 34p

Témata: MATHEMATICAL optimization, APPROXIMATION theory, ALGORITHM research, FRACTIONAL integrals, PROTEIN research, CLUSTER analysis (Statistics)