Results 31 to 40 of about 415,790 (230)
If the Current Clique Algorithms are Optimal, so is Valiant's Parser
, 2015 The CFG recognition problem is: given a context-free grammar $\mathcal{G}$ and a string $w$ of length $n$, decide if $w$ can be obtained from $\mathcal{G}$. This is the most basic parsing question and is a core computer science problem.
Abboud, Amir +2 more
core +1 more source
Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions [PDF]
IEEE Transactions on Information Theory, 2016 Symbol-pair codes introduced by Cassuto and Blaum (2010) are designed to protect against pair errors in symbol-pair read channels. The higher the minimum pair distance, the more pair errors the code can correct.
Bocong Chen, Liren Lin, Hongwei Liu
semanticscholar +1 more source
Clustering Algorithm Reveals Dopamine‐Motor Mismatch in Cognitively Preserved Parkinson's Disease
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore the relationship between dopaminergic denervation and motor impairment in two de novo Parkinson's disease (PD) cohorts. Methods n = 249 PD patients from Parkinson's Progression Markers Initiative (PPMI) and n = 84 from an external clinical cohort.
Rachele Malito +14 more
wiley +1 more source
Synchronization Strings: Explicit Constructions, Local Decoding, and Applications
, 2017 This paper gives new results for synchronization strings, a powerful combinatorial object that allows to efficiently deal with insertions and deletions in various communication settings: $\bullet$ We give a deterministic, linear time synchronization ...
An +7 more
core +1 more source
The symbol-pair distance distribution of repeated-root cyclic codes over $\mathbb{F}_{p^m}$
, 2016 Symbol-pair codes are proposed to protect against pair errors in symbol-pair read channels. One of the most important task in symbol-pair coding theory is to determine the minimum pair-distance of symbol-pair codes. In this paper, we investigate the symbol-pair distances of cyclic codes of length $p^e$ over $\mathbb{F}_{p^m}$.
Zhu, Shixin, Sun, Zhonghua, Wang, Liqi
openaire +2 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background and Objectives Multiple sclerosis (MS) exhibits racially disparate rates of disease progression. Black people with MS (B‐PwMS) experience a more severe disease course than non‐Hispanic White people with MS (NHW‐PwMS). Here we investigated structural and functional connectivity as well as structure–function decoupling in the ...
Emilio Cipriano +11 more
wiley +1 more source
Wireless ad-hoc networks: Strategies and Scaling laws for the fixed SNR regime
, 2006 This paper deals with throughput scaling laws for random ad-hoc wireless networks in a rich scattering environment. We develop schemes to optimize the ratio, $\rho(n)$ of achievable network sum capacity to the sum of the point-to-point capacities of ...
Aeron, Shuchin, Saligrama, Venkatesh
core +1 more source
Advanced Engineering Materials, Volume 27, Issue 6, March 2025.The stability criteria affecting the formation of high‐entropy alloys, particularly focusing in supersaturated solid solutions produced by mechanical alloying, are analyzed. Criteria based on Hume–Rothery rules are distinguished from those derived from thermodynamic relations. The formers are generally applicable to mechanically alloyed samples.
Javier S. Blázquez +5 more
wiley +1 more source
Statefinder diagnosis and the interacting ghost model of dark energy
, 2012 A new model of dark energy namely "ghost dark energy model" has recently been suggested to interpret the positive acceleration of cosmic expansion. The energy density of ghost dark energy is proportional to the hubble parameter.
A. Anisimov +102 more
core +1 more source
List Decodability of Symbol-Pair Codes [PDF]
IEEE Transactions on Information Theory, 2018 We investigate the list decodability of symbol-pair codes1 in this paper. First, we show that the list decodability of every symbol-pair code does not exceed the Gilbert–Varshamov bound. On the other hand, we are able to prove that with high probability,
Shu Liu, C. Xing, Chen Yuan
semanticscholar +1 more source