Results 291 to 300 of about 307,376 (353)
A Tutorial on Automated Mass Spectral Analysis Using <i>NucleoSpec</i> for Compositional Assignment of Nucleic Acid-Silver Complexes and Nanoclusters. [PDF]
ACS Meas Sci AuLin IH, Copp SM.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Simple Key Enumeration (and Rank Estimation) Using Histograms: An Integrated Approach
Lecture Notes in Computer Science, 2016François-Xavier Standaert +1 more
exaly +2 more sources
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs
SIGMOD Conference, 2020Subgraph enumeration is important for many applications such as network motif discovery and community detection. Recent works utilize graphics processing units (GPUs) to parallelize subgraph enumeration, but they can only handle graphs that fit into the ...
Wen-Tian Guo +5 more
semanticscholar +1 more source
Acta Materialia, 2019
This paper presents a review of recent experimental evidence and simulation results enumerating the development of the hydrogen-enhanced localized plasticity (HELP) mechanism as a viable hydrogen embrittlement mechanism for structural materials.
May L. Martin +4 more
semanticscholar +1 more source
This paper presents a review of recent experimental evidence and simulation results enumerating the development of the hydrogen-enhanced localized plasticity (HELP) mechanism as a viable hydrogen embrittlement mechanism for structural materials.
May L. Martin +4 more
semanticscholar +1 more source
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2019As data analytics becomes more crucial to digital systems, so grows the importance of characterizing the database queries that admit a more efficient evaluation.
Nofar Carmeli +4 more
semanticscholar +1 more source
Enumeration Degrees and Enumerability of Familes
Journal of Logic and Computation, 2009We study the enumerability of families relative to the enumeration degrees. It is shown that if a family of finite sets is e-reducible to every non-zero e-degree, then the family is computably enumerable (c.e). On the another hand, we will find a non-c.e. family which is e-reducible to all non-zero e-degree.
openaire +4 more sources