نتایج جستجو برای: co farthest map
تعداد نتایج: 522648 فیلتر نتایج به سال:
The hemodynamic effects of dopamine were studied in 62 patients with clinical shock. In 36 patients with infection dopamine increased mean arterial pressure (MAP) 30%, and cardiac output (CO) 37%. Urine flow (UF) increased from 0.5 ml/min to 1.6 ml/min. Norepinephrine (NE) in 26 patients resulted in a higher MAP, lower CO, and similar UF. Isoproterenol (Isp) in 19 patients resulted in a lower M...
The farthest string problem (FARTHEST STRING) is one of the core problems in the field of consensus word analysis and several biological problems such as discovering potential drugs, universal primers, or unbiased consensus sequences. Given k strings of the same length L and a nonnegative integer d, FARTHEST STRING is to find a string s such that none of the given strings has a Hamming distance...
We will describe an O(n) time reduction from the set-disjointness problem to the farthest pairs problem. This will imply the Ω(n log n) lower bound. Consider an instance of the set-disjointness problem A = {a1, a2, . . . , an} and B = {b1, b2, . . . , bn}. We need to find out whether there exist i and j such that ai = bj. We map the sets A and B to the first and third quadrant of the unit circl...
We propose a metric-learning framework for computing distance-preserving maps that generate low-dimensional embeddings for a certain class of manifolds. We employ Siamese networks to solve the problem of least squares multidimensional scaling for generating mappings that preserve geodesic distances on the manifold. In contrast to previous parametric manifold learning methods we show a substanti...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید