Results 201 to 210 of about 18,622 (258)

Most German Speakers Ignore the Cue That Best Predicts Plural Class. [PDF]

Open Mind (Camb)
McCurdy K, O'Donnell TJ, Lopez A, Goldwater S.   +3 more
europepmc   +1 more source

MRS-BIDS, an extension to the Brain Imaging Data Structure for magnetic resonance spectroscopy. [PDF]

Sci Data
Bouchard AE, Wong D, Bogner W, Gau R, Halchenko YO, Lamb DG, Markiewicz CJ, Mullins PG, Niso G, Oeltzschner G, BIDS Maintainers, Clarke WT, Wilson M, Mikkelsen M.   +13 more
europepmc   +1 more source

Missing value replacement in strings and applications. [PDF]

Data Min Knowl Discov
Bernardini G, Liu C, Loukides G, Marchetti-Spaccamela A, Pissis SP, Stougie L, Sweering M.   +6 more
europepmc   +1 more source

Reconstruction of Multiple Strings of Constant Weight from Prefix-Suffix Compositions. [PDF]

Entropy (Basel)
Yang Y, Chen Z.
europepmc   +1 more source

Erratum: Innovative approaches to health promotion for older adults. [PDF]

J Educ Health Promot
europepmc   +1 more source

Differentiating Pediatric Bipolar Disorder, Attention-Deficit/Hyperactivity Disorder, and Other Psychopathologies Using Self-Reported Mood and Energy Data and Actigraphy Findings: Correlation and Machine Learning-Based Prediction of Mood Severity.

JMIR Ment Health
Diler RS, Vahedifard F, Birmaher B, Iyengar S, Wolfe M, Lepore BN, Chobany M, Abdul-Waalee H, Malgireddy G, Hart JA, Bertocci MA.   +10 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Evaluative Suffixes

2022
This handbook chapter treats phenomena from the domain of Romance evaluative suffixes which are of potential interest to general linguists.
Fortin, Antonio, Rainer, Franz
openaire   +1 more source

From Suffix Trees to Suffix Vectors

International Journal of Foundations of Computer Science, 2006
We present a first formal setting for suffix vectors that are space economical alternative data structures to suffix trees. We give two linear algorithms for converting a suffix tree into a suffix vector and conversely. We enrich suffix vectors with formulas for counting the number of occurrences of repeated substrings.
Prieur, Elise, Lecroq, Thierry
openaire   +3 more sources

Optimal suffix selection

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, 2007
Given a string S[1·s n], the suffix selection problemis to find the kth lexicographically smallest amongst the n suffixes S[i·s n], for i=1,...,n. In particular, the fundamental question is if selection can be performed more efficiently than sorting all the suffixes.If one considered n numbers, they can be sorted using Θ(n log n) comparisonsand the ...
FRANCESCHINI, GIANNI, S. Muthukrishnan
openaire   +2 more sources