Results 11 to 20 of about 449,948 (311)
Splitting Choice and Computational Complexity Analysis of Decision Trees. [PDF]
Some theories are explored in this research about decision trees which give theoretical support to the applications based on decision trees. The first is that there are many splitting criteria to choose in the tree growing process.
Zhao X, Nie X.
europepmc +2 more sources
The complexity of meta-computational problems [PDF]
This thesis focuses on problems which themselves encode questions about circuits or algorithms, also called meta-computational problems. The thesis is centered on meta-computational problems like C-MCSP (minimum circuit size problem), C-Learnability and ...
Rajgopal, Ninad
core +2 more sources
Efficient computation of optimal temporal walks under waiting-time constraints
Node connectivity plays a central role in temporal network analysis. We provide a broad study of various concepts of walks in temporal graphs, that is, graphs with fixed vertex sets but arc sets changing over time. Taking into account the temporal aspect
Matthias Bentert +3 more
doaj +1 more source
h-Index manipulation by undoing merges
The h-index is an important bibliographic measure used to assess the performance of researchers. Dutiful researchers merge different versions of their articles in their Google Scholar profile even though this can decrease their h-index.
René van Bevern +5 more
doaj +1 more source
Computation in Complex Networks [PDF]
The Special Issue on “Computation in Complex Networks” focused on gathering highly original papers in the field of current complex network research [...]
Pizzuti C, Socievole A
openaire +5 more sources
Cryptanalysis of a white‐box SM4 implementation based on collision attack
White‐box cryptography is to primarily protect the key of a cipher from being extracted in a white‐box scenario, where an adversary has full access to the execution environment of software implementation. Since the introduction of white‐box cryptography,
Rusi Wang +3 more
doaj +1 more source
Group mixing drives inequality in face-to-face gatherings
The emergence of inequality in social interactions can depend on a number of factors, among which the intrinsic attractiveness of individuals, but also group size the presence of pre-formed social ties.
Marcos Oliveira +5 more
doaj +1 more source
IntroductionThe COVID-19 pandemic, especially its early stages, sparked extensive discussions regarding the potential impact of metabolic and cardiovascular comorbidities on the severity and fatality of SARS-CoV-2 infection, yielding inconclusive ...
Jonathan Ariel López-Cuevas +7 more
doaj +1 more source
Complexity of computations [PDF]
The framework for research in the theory of complexity of computations is described, emphasizing the interrelation between seemingly diverse problems and methods. Illustrative examples of practical and theoretical significance are given. Directions for new research are discussed.
openaire +2 more sources
ON THE COMPLEXITY OF COMPUTING DETERMINANTS [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erich L. Kaltofen, Gilles Villard
openaire +1 more source

