نتایج جستجو برای: efficient (kd )
تعداد نتایج: 449962 فیلتر نتایج به سال:
salicylic acid-formaldehyde-m-cresol (sfm) terpolymer had been synthesized in dmf media by conventional method. the resulting resin had been characterized by ftir spectra, elemental and thermogravimetric analyses. the morphology of sfm resin had been studied by sem and optical photograph. various parameters like rate of equilibration, effect of ph on ion exchange capacity and effect of concentr...
The effects of dissolved organic matter (DOM), derived from compost, on the sorption of simazine by soils were studied using a batch equilibrium technique. Six soils with different organic carbon contents were investigated in this study. Simazine sorption isotherms on soils were described by the linear equation, and the distribution coefficients without DOM (Kd) or with DOM (Kd*) were obtained....
Efficient ray shooting algorithm is inherently required by many computer graphics algorithms, particularly in image synthesis. Practical ray shooting algorithms aiming at the average-case complexity use some underlying spatial data structure such as kd-tree. We show the new termination criteria algorithm that improves the space and time complexity of the kd-tree construction. It provides effici...
Background and Aim: Tuberculosis is an infectious disease with worldwide distribution. Based on WHO report one third of people are affected with mycobacterium tuberculosis. Today, the traditional bacteriological methods are only available using diagnostic methods for detection of tuberculosis. Innovation of a simple and efficient method for the diagnosis of tuberculosis is one of the most impor...
Introduction Macrophage activation syndrome (MAS) is a rare and life-threatening complication of Kawasaki Disease (KD) that is usually diagnosed at the same time or after KD. We report a case of MAS as the initial manifestation of KD. Case Report A previously healthy 3-year old girl was admitted to the pediatric infectious di...
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional and large data set clustering. In this paper, we propose an efficient method that allows mean shift clustering performed on large data set containing tens of millions of points at interactive rate. The key in our metho...
In this paper we consider the problem of finding sets of points that conform to a given underlying model from within a dense, noisy set of observations. This problem is motivated by the task of efficiently linking faint asteroid detections, but is applicable to a range of spatial queries. We survey current tree-based approaches, showing a tradeoff exists between single tree and multiple tree al...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید