Results 241 to 250 of about 20,325,694 (338)

Developing a QSPR model for Alzheimer's drugs using topological indices and M-polynomial: A computational study. [PDF]

Sci Rep
Akhbari MH, Movahedi F, Zameni M, Shahavi MH.   +3 more
europepmc   +1 more source

Synchronous and Asynchronous Variation of Taxonomic and Phylogenetic Diversity During the Succession of <i>Pinus kesiya</i> var. <i>langbianensis</i> Forest in Yunnan, China. [PDF]

Ecol Evol
Wang X, Ma Y, Zhao B, Chen D, Luo Y, Peng M, Li Y, Zhou X, Chen W, Tang CQ, Wang C.   +10 more
europepmc   +1 more source

Influence of the Initial Prestress Level on the Reliability Index of Geiger Dome. [PDF]

Materials (Basel)
Obara P, Radoń U, Zabojszcza P.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A spatiotemporal data model and an index structure for computational time geography

International Journal of Geographical Information Science, 2022
The availability of Spatiotemporal Big Data has provided a golden opportunity for time geographical studies that have long been constrained by the lack of individual-level data.
B. Chen, Yuhua Luo, Tao Jia, Hui-Ping Chen, Xuan-Yan Chen, J. Gong, Qingquan Li   +6 more
semanticscholar   +1 more source

LISA: A Learned Index Structure for Spatial Data

SIGMOD Conference, 2020
In spatial query processing, the popular index R-tree may incur large storage consumption and high IO cost. Inspired by the recent learned index [17] that replaces B-tree with machine learning models, we study an analogy problem for spatial data.
Pengfei Li, Hua Lu, Qian Zheng, Long Yang, Gang Pan   +4 more
semanticscholar   +1 more source

BB-Tree: A Main-Memory Index Structure for Multidimensional Range Queries

IEEE International Conference on Data Engineering, 2019
We present the BB-Tree, a fast and space-efficient index structure for processing multidimensional workloads in main memory. It uses a k-ary search tree for pruning and searching while keeping all data in leaf nodes.
Stefan Sprenger, Patrick Schäfer, U. Leser   +2 more
semanticscholar   +1 more source

SLING: A Near-Optimal Index Structure for SimRank

SIGMOD Conference, 2016
SimRank is a similarity measure for graph nodes that has numerous applications in practice. Scalable SimRank computation has been the subject of extensive research for more than a decade, and yet, none of the existing solutions can efficiently derive ...
Boyu Tian, Xiaokui Xiao
semanticscholar   +1 more source

Computing the Structural Index

SIAM Journal on Algebraic Discrete Methods, 1986
This paper deals with a subclass of differential/algebraic equations which can be solved by backward differentiation methods if their index (determined by the structure of the system) does not exceed two. The authors extend the algorithm given by the first author [On algorithms for obtaining a maximum transversal, ACM Trans. Math.
Duff, I. S., Gear, C. W.
openaire   +1 more source

Structure of index invariant systems

1971 IEEE Conference on Decision and Control, 1971
This paper introduces the concept of a controllability module and then uses it to study certain algebraic properties of index-invariant, time-varying, linear systems. It is shown that controllability modules possess a property similar to the pole placement property of controllability subspaces.
Morse, A. S., Silverman, L. M.
openaire   +2 more sources