The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A new implementation of seismic data processing approach based on parallel wavelet transform is presented in this paper. Firstly, the feasibility and necessity of the parallel processing method for seismic data are elaborated from three primary aspects. Based on the analysis, the parallel wavelet transform is implemented by using MATLAB on a distributed cluster. Finally, both sequential and parallel...
A new declustering data algorithm based on k-medoids clustering is presented in this paper. Since the k-medoids clustering algorithm is able to discover distribution of the objects, the proposed method uses it to figure out which objects are neighboring to be distributed into different disks. Compared with the existing algorithms, our algorithm has the advantages of taking the overall proximities...
A parallel bulk loading algorithm of M-tree is proposed in this paper, which takes advantage of the multi-core chips. The sequential bulk loading algorithm of M-tree consists of three steps: partition, recursion and aggregation, and we parallelize the first two steps. In the partition step, the whole dataset are split and assigned to several independent threads. Then, a tree-structure tasks graph...
A shared memory parallel k-NN algorithm for M-tree index structure is introduced in this paper, which is called SMP A-NN. The processing of the pending request (PR) queue is a core operation in the traditional k-NN query algorithm, which is also time-consuming. Therefore, we separate the long queue into multi-parts and assign them to different threads. This improvement takes full advantage of SMP...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.