Results 151 to 160 of about 37,788,190 (381)

Performance of Linear and Spiral Hashing Algorithms

Algorithms
Linear Hashing is an important algorithm for many key-value stores in main memory. Spiral Storage was invented to overcome the poor fringe behavior of Linear Hashing, but after an influential study by Larson, it seems to have been discarded. Since almost
Arockia David Roy Kulandai, Thomas Schwarz   +1 more
doaj   +1 more source

A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query [PDF]

arXiv, 2011
We revisit the range minimum query problem and present a new O(n)-space data structure that supports queries in O(1) time. Although previous data structures exist whose asymptotic bounds match ours, our goal is to introduce a new solution that is simple, intuitive, and practical without increasing costs for query time or space.
arxiv  

Computational graph pangenomics: a tutorial on data structures and their applications. [PDF]

Nat Comput, 2022
Baaijens JA, Bonizzoni P, Boucher C, Della Vedova G, Pirola Y, Rizzi R, Sirén J.   +6 more
europepmc   +1 more source

Mathematical Structure of Nonarithmetic Data Processing Procedures [PDF]

, 1962
Lionello Lombardi
openalex   +1 more source

Exploring multivariate data structures with local principal curves. [PDF]

, 2005
A new approach to find the underlying structure of a multidimensional data cloud is proposed, which is based on a localized version of principal components analysis. More specifically, we calculate a series of local centers of mass and move through the
Einbeck, Jochen, Evers, Ludger, Gaul, W., Tutz, Gerhard, Weihs, C.   +4 more
core   +1 more source

Etoposide‐induced cancer cell death: roles of mitochondrial VDAC1 and calpain, and resistance mechanisms

Molecular Oncology, EarlyView.
The complex mode of action of the topoisomerase II inhibitor etoposide in triggering apoptosis involves several mechanisms: overexpression of the mitochondrial protein VDAC1, leading to its oligomerization and formation of a large channel that mediates the release of pro‐apoptotic protein; and overexpression of the apoptosis regulators p53, Bax, and ...
Aditya Karunanithi Nivedita, Varda Shoshan‐Barmatz   +1 more
wiley   +1 more source

Sequential Consistency and Concurrent Data Structures [PDF]

arXiv, 2015
Linearizability, the de facto correctness condition for concurrent data structure implementations, despite its intuitive appeal is known to lead to poor scalability. This disadvantage has led researchers to design scalable data structures satisfying consistency conditions weaker than linearizability. Despite this recent trend, sequential consistency as
arxiv  

Phase velocities of long-period surface waves and structure of the upper mantle: 1. Great-Circle Love and Rayleigh wave data [PDF]

, 1966
M. Nafi Toksöz, Don L. Anderson
openalex   +1 more source

Maximum Inner-Product Search using Tree Data-structures [PDF]

, 2012
The problem of {\em efficiently} finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied in literature.
Gray, Alexander G., Ram, Parikshit
core  

Respiratory complex I‐mediated NAD+ regeneration regulates cancer cell proliferation through the transcriptional and translational control of p21Cip1 expression by SIRT3 and SIRT7

Molecular Oncology, EarlyView.
NAD+ regeneration by mitochondrial complex I NADH dehydrogenase is important for cancer cell proliferation. Specifically, NAD+ is necessary for the activities of NAD+‐dependent deacetylases SIRT3 and SIRT7, which suppress the expression of p21Cip1 cyclin‐dependent kinase inhibitor, an antiproliferative molecule, at the translational and transcriptional
Masato Higurashi, Kazunori Mori, Hidetsugu Nakagawa, Momoko Uchida, Fumihiro Ishikawa, Motoko Shibanuma   +5 more
wiley   +1 more source