Results 261 to 270 of about 477,458 (300)

The association between the use of dry cow therapy and bacteriological cure after calving and the development of phenotypic antimicrobial resistance on Egyptian dairy farms. [PDF]

PLoS One
ElAshmawy WR, Bakry NM, El-Sayed SM, Fahim KM, Aljuaydi SH, AbuBakr HO, Fayed AA, Elhelw R, Aly SS, Farag HS.   +9 more
europepmc   +1 more source

Solving project scheduling problems by minimum cut computations.

Stork, Frederik, Uetz, Marc, Mohring, Rolf H., Schulz, Andreas S.   +3 more
core  

Internal jugular vein collapsibility index versus common carotid artery peak systolic velocity variation for prediction of post-spinal hypotension: A prospective observational study. [PDF]

J Anaesthesiol Clin Pharmacol
Arora P, Kathuria S, Jain R, Gupta S, Jain S.   +4 more
europepmc   +1 more source

Computational experience with a bundle approach for semidenfinite cutting plane relaxations of max-cut and equipartition.

Rendl, F., Sotirov, R., Gruber, G., Fischer, I.   +3 more
core  

Clustering by Minimum Cut Hyperplanes

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2017
Minimum normalised graph cuts are highly effective ways of partitioning unlabeled data, having been made popular by the success of spectral clustering. This work presents a novel method for learning hyperplane separators which minimise this graph cut objective, when data are embedded in Euclidean space.
David P Hofmeyr
exaly   +4 more sources

Minimum Cuts for Circular-Arc Graphs

SIAM Journal on Computing, 1990
Summary: The problem of finding a minimum cut of n arcs on a unit circle is considered. It is shown that this problem can be solved in \(\Theta\) (n log n) time, which is optimal to within a constant factor. If the endpoints of the arcs are sorted, the problem can be solved in linear time.
D. T. Lee, Majid Sarrafzadeh, Ying-Fung Wu   +2 more
openaire   +3 more sources

On the minimum cut separator problem

Networks, 2011
AbstractGiven G = (V,E) an undirected graph and two specified nonadjacent nodes a and b of V, a cut separator is a subset F =δ (C) ⊆ E such that a,b∈V / C and a and b belong to different connected components of the graph induced by V / C. Given a non‐negative cost vector \documentclass{article} \usepackage{mathrsfs} \usepackage{amsmath, amssymb ...
Ben-Ameur, Walid, Didi Biha, Mohamed
openaire   +4 more sources