Results 261 to 270 of about 1,228,420 (310)

Age-Stratified Modeling of Clinical Heterogeneity in Polycystic Ovary Morphology Using Ultrasound-Based Machine Learning. [PDF]

Int J Womens Health
Kuang C, Wei Q, Liu Z, Zhang Y, Zhong Z, Hu N, Xiao C, Bao L, Xiao Y, Du M, Chen Z.   +10 more
europepmc   +1 more source

Postdilation Strategies Following Provisional Stenting of Left Main Coronary Bifurcations: Insights From Patient-Specific Computational Simulations. [PDF]

JACC Adv
Zhao S, Wu W, Lee C, Trivedi YV, Patel P, Munjal P, Tapia-Orihuela RKA, Bhat RR, Chikatimalla R, Miriyala V, Issa Y, Alam MF, Singh PV, Darapaneni H, Vijayarao SS, Shaar A, Sahni JK, Goswami K, Agrawal A, Chatzizisi I, Louvard Y, Stankovic G, Lassen JF, Murasato Y, Johnson TW, Burzotta F, Brilakis ES, Dangas G, Chatzizisis YS.   +28 more
europepmc   +1 more source

Brachial artery wall shear stress as measured by ultrasound vector flow imaging for evaluating arteriovenous fistula stenosis in patients on hemodialysis. [PDF]

Quant Imaging Med Surg
Peng S, Yang C, Yin S, Hu J, He X.
europepmc   +1 more source

Estradiol alters actin and protrusion dynamics in endometriotic epithelial cells. [PDF]

J Biol Phys
Banerjee S, Herr C, Losert W, Stroka KM.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

MINIMUM FLOW VARIATION IN MAXIMUM FLOWS

Discrete Mathematics, Algorithms and Applications, 2010
Network flows are of growing interest in both applications and theory. Given a network flow with costs and arc capacities, the classical max flow-min cost problem is to send a given amount of flow from the source vertex to the sink vertex at least cost.
M. Masoumi, A. M. Mobasseri, A. R. Rezaei   +2 more
openaire   +2 more sources

Maximum Flow in Planar Networks

SIAM Journal on Computing, 1979
Efficient algorithms for finding maximum flow in planar networks are presented. These algorithms take advantage of the planarity and are superior to the most efficient algorithms to date. If the source and the terminal are on the same face, an algorithm of Berge is improved and its time complexity is reduced to $O(n\log n)$.
Alon Itai, Yossi Shiloach
openaire   +1 more source

Maximum flows in probabilistic networks

Networks, 1991
AbstractThe reliability of capacitated networks subject to random arc failures is evaluated by the expected value of maximum flow. It is known that calculating the expected value of maximum flow is NP‐hard, but a lower bound can be efficiently computed by the method of Carey and Hendrickson.
Hiroshi Nagamochi, Toshihide Ibaraki
openaire   +1 more source

Decentralized maximum‐flow protocols

Networks, 1982
AbstractThis article presents three protocols for obtaining maximum flow in a network by using distributed computation. Each node in the network has memory and processing capabilities and coordinates the algorithm with its neighbors by means of control messages. In the order presented, each protocol employs less communication than the previous one, but
openaire   +1 more source