Results 1  10
of
118,599
Partitioning algorithm
"... As one of the key technologies for improving the efficiency of parallel processing of a huge volume spatial data under the distributed parallel computing environment, the parallel spatial indexing mechanism is discussed in this paper. On the viewpoint of the existing research results, the classical ..."
Abstract
 Add to MetaCart
) is presented. Differing from the present parallel spatial indexing structures, the attributes of the parallel computing pattern has been considered adequately, and a high performance parallel spatial data partitioning algorithm (HCSDP, spatial data partitioning algorithm based on the Hilbert spatial filling
Partitioning algorithm
"... As one of the key technologies for improving the efficiency of parallel processing of a huge volume spatial data under the distributed parallel computing environment, the parallel spatial indexing mechanism is discussed in this paper. On the viewpoint of the existing research results, the classical ..."
Abstract
 Add to MetaCart
) is presented. Differing from the present parallel spatial indexing structures, the attributes of the parallel computing pattern has been considered adequately, and a high performance parallel spatial data partitioning algorithm (HCSDP, spatial data partitioning algorithm based on the Hilbert spatial filling
Architecture aware partitioning algorithms
, 2006
"... Existing partitioning algorithms provide limited support for load balancing simulations that are performed on heterogeneous parallel computing platforms. On such architectures, effective load balancing can only be achieved if the graph is distributed so that it properly takes into account the availa ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Existing partitioning algorithms provide limited support for load balancing simulations that are performed on heterogeneous parallel computing platforms. On such architectures, effective load balancing can only be achieved if the graph is distributed so that it properly takes into account
Architecture Aware Partitioning Algorithms *
"... Abstract Existing partitioning algorithms provide limited support for load balancing simulations thatare performed on heterogeneous parallel computing platforms. On such architectures, effective load balancing can only be achieved if the graph is distributed so that it properly takes intoaccount the ..."
Abstract
 Add to MetaCart
Abstract Existing partitioning algorithms provide limited support for load balancing simulations thatare performed on heterogeneous parallel computing platforms. On such architectures, effective load balancing can only be achieved if the graph is distributed so that it properly takes intoaccount
A fast and high quality multilevel scheme for partitioning irregular graphs
 SIAM JOURNAL ON SCIENTIFIC COMPUTING
, 1998
"... Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc. ..."
Abstract

Cited by 1189 (15 self)
 Add to MetaCart
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc.
New Graph Partitioning Algorithms
, 1998
"... Graph partitioning problems are NPcomplete and various heuristic algorithms exist in the litterature. Particularly, spectral graph partitioning algorithms partition the graph using the eigenvector associated with the second smallest eigenvalue of the "graph Laplacian." Through the use of ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Graph partitioning problems are NPcomplete and various heuristic algorithms exist in the litterature. Particularly, spectral graph partitioning algorithms partition the graph using the eigenvector associated with the second smallest eigenvalue of the "graph Laplacian." Through the use
Partition Algorithm for System Identification
, 2001
"... We review the fundamentals of filtering theory and of the Lainiotis Partition Algorithm for system identification. Original reults are presented on the question of convergence of the Lainiotis algorithm; namely convergence is proved (within the algorithm's resolution) as long as certain exponen ..."
Abstract
 Add to MetaCart
We review the fundamentals of filtering theory and of the Lainiotis Partition Algorithm for system identification. Original reults are presented on the question of convergence of the Lainiotis algorithm; namely convergence is proved (within the algorithm's resolution) as long as certain
An Interval Partitioning Algorithm for . . .
"... We propose an efficient interval partitioning algorithm to solve the continuous Constraint Satisfaction Problem (CSP). The method comprises a new dynamic tree search management system that also invokes local search in selected subintervals. This approach is compared with two classical tree search t ..."
Abstract
 Add to MetaCart
We propose an efficient interval partitioning algorithm to solve the continuous Constraint Satisfaction Problem (CSP). The method comprises a new dynamic tree search management system that also invokes local search in selected subintervals. This approach is compared with two classical tree search
Vertical Partitioning Algorithms for Database Design
 ACM Transactions on Database Systems
, 1984
"... This paper addresses the vertical partitioning of a set of logical records or a relation into fragments. The rationale behind vertical partitioning is to produce fragments, groups of attribute columns, that “closely match ” the requirements of transactions. Vertical partitioning is applied in three ..."
Abstract

Cited by 106 (9 self)
 Add to MetaCart
This paper addresses the vertical partitioning of a set of logical records or a relation into fragments. The rationale behind vertical partitioning is to produce fragments, groups of attribute columns, that “closely match ” the requirements of transactions. Vertical partitioning is applied in three
A LinearTime Heuristic for Improving Network Partitions
, 1982
"... An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning. To d ..."
Abstract

Cited by 524 (0 self)
 Add to MetaCart
An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning
Results 1  10
of
118,599