Results 31 to 40 of about 11,352,047 (344)
CONSTRUCTIVE MODEL OF DATA STRUCTURES ADAPTATION IN RAM: PART I. PROGRAM TEXT CONSTRUCTING
Purpose. Rapidly growing volumes of information systems data being manipulated significantly reduce the temporary algorithms effeciency of their processing . Effective data layout in RAM is one of the directions of solving this problem.
V. I. Shynkarenko, H. V. Zabula
doaj +1 more source
In this contribution, we provide a detailed analysis of the search operation for the Interval Merging Binary Tree (IMBT), an efficient data structure proposed earlier to handle typical anomalies in the transmission of data packets.
István Finta+2 more
doaj +1 more source
Application of Generalized (Hyper-) Dual Numbers in Equation of State Modeling
The calculation of derivatives is ubiquitous in science and engineering. In thermodynamics, in particular, state properties can be expressed as derivatives of thermodynamic potentials. The manual differentiation of complex models can be tedious and error-
Philipp Rehner, Gernot Bauer
doaj +1 more source
Surface network extraction from high resolution digital terrain models
A surface network is a topological data structure formed by a set of thalwegs and ridges on a digital terrain model. Its computation relies on the detection of saddles on the terrain.
Eric Guilbert
doaj +1 more source
Very recently, the unexpected combination of data structures and machine learning has led to the development of a new area of research, called learned data structures. Their distinguishing trait is the ability to reveal and exploit patterns and trends in the input data for achieving more efficiency in time and space, compared to previously known data ...
Paolo Ferragina, Giorgio Vinciguerra
openaire +3 more sources
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
A binary time series can be transformed into a Branch Length Similarity (BLS) entropy profile by being mapped to a circumference called a time-circle. In this study, we explored how peaks and cliffs are formed and how they relate to time series.
Sang-Hee Lee, Cheol-Min Park
doaj +1 more source
The unpredictably eruptive dynamics of spruce budworm populations in eastern Canada
We examine historical population data for spruce budworm from several locations through the period 1930–1997, and use density‐dependent recruitment curves to test whether the pattern of population growth over time is more consistent with Royama's (1984; Ecological Monographs 54:429–462) linear R(t) model of harmonic oscillation at Green River New ...
Barry J. Cooke, Jacques Régnière
wiley +1 more source
Static Data Structure Lower Bounds Imply Rigidity
We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity of linear data
Agarwal Pankaj K.+9 more
core +1 more source
Geometric city modeling is an open problem without standard solutions. Within this problem, there appear several sub-problems that must be faced, like the accurate modeling of streets, buildings and other architectonic structures. One important source of geographical information is (measured) cadastral urban data.
Pueyo Vallet, Oriol, Patow, Gustavo
openaire +3 more sources