20 results for “counting sequence”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper proposes Supervised Memory Training (SMT), a method for training nonlinear RNNs that sidesteps recurrent credit propagation entirely.
This paper presents a set of formulas and equations to compute the longest counting sequence of convex polyominoes of degree of convexity at most 2.
This paper presents methods for ranking and unranking permutations avoiding a pattern of length three in lexicographic or colexicographic order.
This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…
This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.
This paper develops and analyzes two differentially private methods for answering counting queries on quantum-encoded datasets, demonstrating improved privacy guarantees and a quantum-safe approach fo…
This paper proposes Stringology-Based Cryptology (SBC), a novel approach that analyzes the structural properties of cryptographic outputs by treating them as symbolic sequences, offering complementary…
The paper proposes a novel two-stage framework to differentially privatize tables of counts by focusing on preserving the accuracy of the underlying count distribution, introducing the specialized cyc…
The paper proves that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations.
Minjia Shi, Xuan Wang, Bouazzaoui Zakariae, Jon-Lark Kim +1 more
The paper investigates generalized Wall-Sun-Sun primes, $WSS(d)$, and uses them to study the weight distributions of specific cyclic codes defined over $ ext{F}_p$ and $ ext{Z}_{p^2}$.
The paper provides a unified algebraic framework to determine the formal language expressivity of recurrent neural language models, resolving conflicts in existing literature by linking expressivity t…
The paper introduces a stringology-based fingerprinting (SBF) framework to structurally analyze cryptographic sequences, demonstrating that pattern analysis can reveal measurable structural signatures…
The paper presents the first general mechanism for counting arbitrary acyclic graph patterns under Local Differential Privacy (LDP), addressing challenges in pattern construction and node duplication.
The paper formally models structure-informed multiple sequence alignment (MSA-S) as an NP-complete optimization problem, establishing a strong computational complexity baseline for the field.
The paper analyzes a fragment of Higher-Order Datalog, showing that restricting recursion to a linear form shifts its expressive power from time complexity to space complexity, specifically capturing…
The paper proposes a privacy-preserving system for crowd monitoring that counts individuals across different locations and time periods using face recognition without ever revealing personal identitie…
The paper proposes constant depth threshold circuits for efficiently detecting epistasis by calculating the relative frequencies of all dataset combinations using specialized hardware architectures.
The paper provides the first machine-checked universal proof, using ring theory, that value-independence implies identical marginal distributions for arithmetic masking, thereby extending the verifica…
Yangtian Zhang, Zhe Wang, Arthur Gretton, Rex Ying +3 more
The paper introduces the Insertion Process (IP), a novel stochastic generative model that learns variable-length, non-monotonic sequence generation by explicitly modeling the insertion order of tokens…