Results 61 to 70 of about 227,714 (275)
FEBS Open Bio, EarlyView.ICP34.5 is one of the most important antihost response proteins. The saRNA‐encoding HSV‐1 neurovirulence protein ICP34.5 clearly mediated the eukaryotic initiation factor 2 alpha subunit (eIF2α) dephosphorylation and significant suppression of innate immune responses in vitro, leading to enhanced expression of the saRNA‐encoded gene.
Xuemin Lu +6 more
wiley +1 more source
Efficient Computation of Expectations under Spanning Tree Distributions
Transactions of the Association for Computational Linguistics, 2021 We give a general framework for inference in spanning tree models. We propose unified algorithms for the important cases of first-order expectations and second-order expectations in edge-factored, non-projective spanning-tree models.
Ran Zmigrod, Tim Vieira, Ryan Cotterell
doaj +1 more source
Spanning trees with a bounded number of leaves [PDF]
Opuscula Mathematica, 2017 In 1998, H. Broersma and H. Tuinstra proved that: Given a connected graph \(G\) with \(n\geq 3\) vertices, if \(d(u)+d(v)\geq n-k+1\) for all non-adjacent vertices \(u\) and \(v\) of \(G\) (\(k\geq 1\)), then \(G\) has a spanning tree with at most \(k ...
Junqing Cai +3 more
doaj +1 more source
Efficient and Effective Directed Minimum Spanning Tree Queries
Mathematics, 2023 Computing directed Minimum Spanning Tree (DMST) is a fundamental problem in graph theory. It is applied in a wide spectrum of fields from computer network and communication protocol design to revenue maximization in social networks and syntactic parsing ...
Zhuoran Wang +4 more
doaj +1 more source
Beyond Order: Perspectives on Leveraging Machine Learning for Disordered Materials
Advanced Engineering Materials, EarlyView.This article explores how machine learning (ML) revolutionizes the study and design of disordered materials by uncovering hidden patterns, predicting properties, and optimizing multiscale structures. It highlights key advancements, including generative models, graph neural networks, and hybrid ML‐physics methods, addressing challenges like data ...
Hamidreza Yazdani Sarvestani +4 more
wiley +1 more source
Spanning Trees and Spanners [PDF]
, 2000 We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.
openaire +2 more sources
Pruning a minimum spanning tree [PDF]
Physica A: Statistical Mechanics and its Applications, 2012 This work employs some techniques in order to filter random noise from the information provided by minimum spanning trees obtained from the correlation matrices of international stock market indices prior to and during times of crisis. The first technique establishes a threshold above which connections are considered affected by noise, based on the ...
openaire +2 more sources
Spanning Trees—Short or Small [PDF]
SIAM Journal on Discrete Mathematics, 1996 We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number $k$ of nodes are required to be connected in the solution. A prototypical example is the $k$MST problem in which we require a tree of minimum weight spanning at least $k$ nodes in an edge-weighted ...
Ravi Sundaram +4 more
openaire +4 more sources
MEMBANGUN POHON MERENTANG MINIMUM DENGAN MENGGUNAKAN ALGORITMA PRIM [PDF]
, 2009 Graph is the method of discrete problem solution searching that was in the real world. Graph has much of concepts. The ones is Tree concept. Tree concept is being the significant and the popular concept because support to applies graph for a lot of ...
SUSIANI, ERNA
core
Advanced Engineering Materials, EarlyView.Ultrahigh‐molecular‐weight polyethylene powders (<≈40 μm) with a bulk density of 260 g L−1 are prepared from a silica supported bisimine pyridine iron catalyst. The nascent product is disentangled and can be thermally densified without loss of its low viscosity.
Adrian Vaghar +4 more
wiley +1 more source