نتایج جستجو برای: grid partitioning and subtractiveclustering
تعداد نتایج: 16843211 فیلتر نتایج به سال:
Partitioning a graph into three pieces, with two of them large and connected, and the third a small “separator” set, is useful for improving the performance of a number of combinatorial algorithms. This is done using the second eigenvector of a matrix defined solely in terms of the incidence matrix, called the graph Laplacian. For sparse graphs, the eigenvector can be efficiently computed using...
The desirable global scalability of Grid systems has steered the research towards the employment of the peer-to-peer (P2P) paradigm for the development of new resource discovery systems. As Grid systems mature, the requirements for such a mechanism have grown from simply locating the desired service to compose more than one service to achieve a goal. In Semantic Grid, resource discovery systems...
The desirable global scalability of Grid systems has steered the research towards the employment of the peer-to-peer (P2P) paradigm for the development of new resource discovery systems. As Grid systems mature, the requirements for such a mechanism have grown from simply locating the desired service to compose more than one service to achieve a goal. In Semantic Grid, resource discovery systems...
This paper presents a comparative study between three versions of adaptive neuro-fuzzy inference system (ANFIS) algorithms and a pseudo-forward equation (PFE) to characterize the North Sea reservoir (F3 block) based on seismic data. According to the statistical studies, four attributes (energy, envelope, spectral decomposition and similarity) are known to be useful as fundamental attributes in ...
In this paper, we propose a new multidimensional access method, called the buddy-tree, to support point as well as spatial data in a dynamic environment. The buddy-tree can be seen as a compromise of the R-tree and the grid file, but it is fundamentally different from each of them. Because grid files loose performance for highly correlated data, the buddy-tree is designed to organize such data ...
We classify clustering algorithms into sequence-based tech-niques|which transform the object net into a linear sequence|and partition-based clustering algorithms. Tsangaris and Naughton TN91, TN92] have shown that the partition-based techniques are superior. However , their work is based on a single partitioning algorithm, the Kernig-han and Lin heuristics, which is not applicable to realistica...
Although explicit time integration schemes require small computational efforts per time step, their efficiency is severely restricted by their stability limits. Indeed, the multi-scale nature of some physical processes combined with highly unstructured meshes can lead some elements to impose a severely small stable time step for a global problem. Multirate methods offer a way to increase the gl...
The paper introduces an approach to bridging the gap between diverse data sources and software for visualization and data analysis. The possibility of XML-based languages for data structure description and the introduction of Grid services allows the possibility of partitioning the problem to straightforward components. The work takes place within gViz, a project within the UK escience Core Pro...
We study the efficiency of different alternatives for a scalable parallel implementation of the self-organizing map (SOM) in the GRID enviroment of variable resources and communications. In particular, we consider an application of data mining in Meteorology, which involves databases of high-dimensional atmospheric patterns. In this work, we focus in network partitioning alternatives, analyzing...
This paper presents new algorithms and data structures required for the generation of grids based on mixed element trees and using flexible refinement approach. Mixed elements trees is an extension of modified octrees that uses several well-shaped primitives such as cuboids, prisms, pyramids and tetrahedra as internal nodes. A flexible refinement approach fits the object geometry and fulfills t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید