Results 21 to 30 of about 6,963,647 (337)
Transfer posterior error probability estimation for peptide identification
BMC Bioinformatics, 2020 Background In shotgun proteomics, database searching of tandem mass spectra results in a great number of peptide-spectrum matches (PSMs), many of which are false positives.
Xinpei Yi, Fuzhou Gong, Yan Fu
doaj +1 more source
Energies, 2021 The increase of distributed energy resources (DERs) in low voltage (LV) distribution networks requires the ability to perform an accurate power flow analysis (PFA) in unbalanced systems.
Stefanos Petridis +5 more
doaj +1 more source
A vision for smart and sustainable cities
IET Smart Cities, 2021 Our built environment is characterized by large, ever‐expanding and highly complex cities. The spatial extent of the interconnected systems that serve these cities leads to higher vulnerability to disruption.
Amr Elnashai, Hussam Mahmoud
doaj +1 more source
Compressed Data Structures for Dynamic Sequences [PDF]
, 2015 We consider the problem of storing a dynamic string $S$ over an alphabet $\Sigma=\{\,1,\ldots,\sigma\,\}$ in compressed form. Our representation supports insertions and deletions of symbols and answers three fundamental queries: $\mathrm{access}(i,S ...
A. Gupta +14 more
core +1 more source
Concurrent Data Structures Linked in Time [PDF]
, 2017 Arguments about correctness of a concurrent data structure are typically carried out by using the notion of linearizability and specifying the linearization points of the data structure's procedures.
Banerjee, Anindya +3 more
core +3 more sources
IEEE Journal of Selected Topics in Signal Processing, 2015 We present structured data fusion (SDF) as a framework for the rapid prototyping of knowledge discovery in one or more possibly incomplete data sets. In SDF, each data set—stored as a dense, sparse, or incomplete tensor—is factorized with a matrix or tensor decomposition.
Sorber, Laurent +2 more
openaire +1 more source
Partially complemented representations of digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 Special issue: Graph ...
Elias Dahlhaus +2 more
doaj +1 more source
Partially persistent search trees with transcript operations [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 When dictionaries are persistent, it is natural to introduce a transcript operation which reports the status changes for a given key over time. We discuss when and how a time and space efficient implementation of this operation can be provided.
Kim S. Larsen
doaj +1 more source
Applied Statistics, 1971 In most computer languages, the data are regarded as being held in machine storage either as individual scalar quantities or as members of rectangular arrays. It would make these languages more useful if the user were allowed to specify the shapes of other structures in which he wished to consider the data as being held, such as triangular arrays ...
Gower, J. C., Hill, I. D.
openaire +1 more source
Inductive benchmarking for purely functional data structures [PDF]
, 2001 Every designer of a new data structure wants to know how well it performs in comparison with others. But finding, coding and testing applications as benchmarks can be tedious and time-consuming.
Moss, G E, Runciman, C
core +1 more source