The one-way communication complexity of reporting k-edit occurrences (including the edit sequences) is Θ(n/m · k log(m|Σ|/k)) bits for 0 < k < m < n/2.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
Hybrid models that add persistent-homology features from fixation time series to traditional statistical features outperform purely statistical baselines for dyslexia detection on the Copenhagen Corpus.
citing papers explorer
-
The Communication Complexity of Pattern Matching with Edits Revisited
The one-way communication complexity of reporting k-edit occurrences (including the edit sequences) is Θ(n/m · k log(m|Σ|/k)) bits for 0 < k < m < n/2.
-
Fixation Sequences as Time Series: A Topological Approach to Dyslexia Detection
Hybrid models that add persistent-homology features from fixation time series to traditional statistical features outperform purely statistical baselines for dyslexia detection on the Copenhagen Corpus.