نتایج جستجو برای: co farthest map

تعداد نتایج: 522648  

2016
Dong-Hoon Lee Do-Wan Lee Bong-Soo Han

The purpose of this study is to acquire accurate diffusion tensor tractography (DTT) results for arcuate fasciculus (AF) fiber tract using Brodmann's area (BA) template for region of interest (ROI) setting. Thirteen healthy subjects were participated in this study. Fractional anisotropy (FA) map of each subject was calculated using diffusion tensor data, and T1w template was co-registered to FA...

Journal: :Journal of applied physiology 2004
Philip N Ainslie Marc J Poulin

This study examined the effect of high, normal, and uncontrolled end-tidal Pco(2) (Pet(CO(2))) on the ventilatory, peak cerebral blood flow velocity (V(p)), and mean arterial blood pressure (MAP) responses to acute hypoxia. Nine healthy subjects undertook, in random order, three hypoxic protocols (end-tidal Po(2) was held at eight steps between 300 and 45 Torr) in conditions of hypercapnia, iso...

Journal: :International Journal of Pure and Apllied Mathematics 2013

Journal: :Monthly Notices of the Royal Astronomical Society: Letters 2008

Journal: :Advances in Mathematics of Communications 2016

2014
Linus Källberg Thomas Larsson

Minimum enclosing balls are used extensively to speed up multidimensional data processing in, e.g., machine learning, spatial databases, and computer graphics. We present a case study of several acceleration techniques that are applicable in enclosing ball algorithms based on repeated farthest-point queries. Parallel GPU solutions using CUDA are developed for both lowand high-dimensional cases....

2006
Rong Liu Varun Jain Hao Zhang

In this paper, we apply Nyström method, a sub-sampling and reconstruction technique, to speed up spectral mesh processing. We first relate this method to Kernel Principal Component Analysis (KPCA). This enables us to derive a novel measure in the form of a matrix trace, based soly on sampled data, to quantify the quality of Nyström approximation. The measure is efficient to compute, well-ground...

Journal: :CoRR 2014
Sharareh Alipour Bahman Kalantari Hamid Homapour

We consider approximation of diameter of a set S of n points in dimension m. Eg̃eciog̃lu and Kalantari [8] have shown that given any p ∈ S, by computing its farthest in S, say q, and in turn the farthest point of q, say q′, we have diam(S) ≤ √ 3 d(q, q′). Furthermore, iteratively replacing p with an appropriately selected point on the line segment pq, in at most t ≤ n additional iterations, the c...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید