Sciweavers

1221 search results - page 15 / 245
» Balanced graph partitioning
Sort
View
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 1 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
CLUSTER
2001
IEEE
13 years 11 months ago
Adaptive Runtime Partitioning of AMR Applications on Heterogeneous Clusters
This paper presents the design and evaluation of an adaptive, system sensitive partitioning and load balancing framework for distributed structured adaptive mesh refinement applic...
Shweta Sinha, Manish Parashar
COMBINATORICS
2007
74views more  COMBINATORICS 2007»
13 years 7 months ago
Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree
Let G be a simple balanced bipartite graph on 2n vertices, δ = δ(G)/n, and ρ0 = δ+ √ 2δ−1 2 . If δ ≥ 1/2 then G has a ρ0n -regular spanning subgraph. The statement is...
Béla Csaba
ISHPC
2000
Springer
13 years 11 months ago
Partitioned Parallel Radix Sort
Partitioned parallel radix sort is a parallel radix sort that shortens the execution time by modifying the load balanced radix sort which is known one of the fastest internal sort...
Shin-Jae Lee, Minsoo Jeon, Andrew Sohn, Dongseung ...
DAGSTUHL
2007
13 years 9 months ago
Weighted Voronoi Region Algorithms for Political Districting
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
Bruno Simeone, Federica Ricca, Andrea Scozzari