Results 321 to 330 of about 42,049,725 (376)
Some of the next articles are maybe not open access.
Adaptive Data Structure Regularized Multiclass Discriminative Feature Selection
IEEE Transactions on Neural Networks and Learning Systems, 2021Feature selection (FS), which aims to identify the most informative subset of input features, is an important approach to dimensionality reduction. In this article, a novel FS framework is proposed for both unsupervised and semisupervised scenarios.
Mingyu Fan +4 more
semanticscholar +1 more source
SIAM Journal on Computing, 1991 Summary: The purpose of this paper is to analyze the maxima properties (value and position) of some data structures. Our theorems concern the distribution of these random variables. Previously known results usually dealt with the mean and sometimes the variance of the random variables. Many of our results rely on diffusion techniques.
Louchard, Guy +2 more
openaire +2 more sources
High-entropy nanoparticles: Synthesis-structure-property relationships and data-driven discovery
Science, 2022High-entropy nanoparticles have become a rapidly growing area of research in recent years. Because of their multielemental compositions and unique high-entropy mixing states (i.e., solid-solution) that can lead to tunable activity and enhanced stability,
Yonggang Yao +12 more
semanticscholar +1 more source
Structural representation of data structures
The European Physical Journal Plus, 2014Study of the morphology of proteins, and their 3D structure, supports investigations of their functions and represents an initial step towards protein-based drug design. The goal of this paper is to define techniques, based on the geometrical and topological structure of protein surfaces, for the detection and analysis of sites of potential protein ...
CANTONI, VIRGINIO +3 more
openaire +3 more sources
Hybrid structure: data structuring for data flow
Microprocessing and Microprogramming, 1989Abstract The asynchronous nature of the data flow model of computations allows exploitation of maximum inherent parallelism in many application programs. However, before the data flow model of computations can become a viable alternative to the control flow model of computations, one has to find practical solutions to some major problems such as ...
Ali R. Hurson, B. Lee
openaire +2 more sources
Structured data in structural analysis software
26th Structures, Structural Dynamics, and Materials Conference, 1985This paper discusses the use of computer data structures in finite- element structural analysis programs. A number of data structure types that have been shown to be useful in such programs are introduced and described. A simple finite-element model is used to demonstrate how the given set of data structure types naturally lend themselves to developing
Donald L. Kunz, A.Stewart Hopkins
openaire +3 more sources
An Efficiently Searchable Encrypted Data Structure for Range Queries
European Symposium on Research in Computer Security, 2017At CCS 2015 Naveed et al. presented first attacks on efficiently searchable encryption, such as deterministic and order-preserving encryption. These plaintext guessing attacks have been further improved in subsequent work, e.g. by Grubbs et al.
F. Kerschbaum, Anselme Tueno
semanticscholar +1 more source
The structure of “data structures”
Proceedings of the ACM '81 conference on - ACM 81, 1981A data structure is defined to be a 4-tuple D, F, S, A>. D and F are Domain and Function definitions which define the externally observable behavior; S and A are a Storage Structure and Algorithms which implement the functions. It is shown that this definition helps organize the field of data structures for presentation to students.
openaire +2 more sources
2012
Data structures are variables that store more than one value. There are many different kinds of data structures. We have already been working with one kind, arrays (e.g., vectors and matrices). We use vectors and matrices when we want to be able to loop through them (or, essentially, have this done for us using vectorized code).
openaire +4 more sources
Data structures are variables that store more than one value. There are many different kinds of data structures. We have already been working with one kind, arrays (e.g., vectors and matrices). We use vectors and matrices when we want to be able to loop through them (or, essentially, have this done for us using vectorized code).
openaire +4 more sources
1981
The Oxford English Dictionary defines the word “recursion” in the following way: RECURSION. [Now rare or obs. 1626]. A backward movement, return.
Chris Mellish, William F. Clocksin
openaire +2 more sources
The Oxford English Dictionary defines the word “recursion” in the following way: RECURSION. [Now rare or obs. 1626]. A backward movement, return.
Chris Mellish, William F. Clocksin
openaire +2 more sources