Results 1  10
of
75
Balanced Partitions of Trees and Applications
, 2012
"... We study the kBALANCED PARTITIONING problem in which the vertices of a graph are to be partitioned into k sets of size at most ⌈n/k ⌉ while minimising the cut size, which is the number of edges connecting vertices in different sets. The problem is well studied for general graphs, for which it canno ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
it cannot be approximated within any factor in polynomial time. However, little is known about restricted graph classes. We show that for trees kBALANCED PARTITIONING remains surprisingly hard. In particular, approximating the cut size is APXhard even if the maximum degree of the tree is constant
Balanced Aspect Ratio Trees: Combining the Advantages of kd Trees and Octrees
"... Given a set S of n points in R^d, we show, for fixed d, how to construct in O(n log n) time a data structure we call the Balanced Aspect Ratio (BAR) tree. A BAR tree is a binary space partition tree on S that has O(logn) depth and in which every region is convex and “fat ” (that is, has a bounded as ..."
Abstract

Cited by 60 (7 self)
 Add to MetaCart
Given a set S of n points in R^d, we show, for fixed d, how to construct in O(n log n) time a data structure we call the Balanced Aspect Ratio (BAR) tree. A BAR tree is a binary space partition tree on S that has O(logn) depth and in which every region is convex and “fat ” (that is, has a bounded
c ○ World Scientific Publishing Company Balanced Partition of Minimum Spanning Trees
"... Communicated by (Name) To better handle situations where additional resources are available to carry out a task, many problems from the manufacturing industry involve dividing a task into a number of smaller tasks, while optimizing a specific objective function. In this paper we consider the problem ..."
Abstract
 Add to MetaCart
the problem of partitioning a given set S of n points in the plane into k subsets, S1,..., Sk, such that max1≤i≤k MST (Si)  is minimized. Variants of this problem arise in applications from the shipbuilding industry. We show that this problem is NPhard, and we also present an approximation algorithm
Color Image Coding, Indexing and Retrieval Using Binary Space Partitioning Tree
 Proc. IEEE ICIP 2001
, 2001
"... This paper presents a unified approach to colour image coding, contentbased indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, traditionally used in gray scale image coding [1, 2] is extended to represent colour images. The BSP tree, hence the structure, of ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper presents a unified approach to colour image coding, contentbased indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, traditionally used in gray scale image coding [1, 2] is extended to represent colour images. The BSP tree, hence the structure
Dynamic process partitioning and migration for irregular applications
 In: International Conference on Parallel Computing in Electrical Engineering PARELEC’2002, Proceedings
, 2002
"... Many practical applications generate irregular, nonbalanced divideandconquer trees which have different depths, possibly also different numbers of successors at different levels. Efcient parallelization is difcult as it requires dynamic partitioning and mapping of such trees to available processo ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Many practical applications generate irregular, nonbalanced divideandconquer trees which have different depths, possibly also different numbers of successors at different levels. Efcient parallelization is difcult as it requires dynamic partitioning and mapping of such trees to available
Partitioning, ordering, and load balancing in a hierarchically parallel hybrid linear solver
 International Journal of High Performance Computing Applications
, 2012
"... PDSLin is a generalpurpose algebraic parallel hybrid (direct/iterative) linear solver based on the Schur complement method. The most challenging step of the solver is the computation of a preconditioner based on an approximate global Schur complement. We investigate two combinatorial problems to en ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
to enhance PDSLin’s performance at this step. The first is a multiconstraint partitioning problem to balance the workload while computing the preconditioner in parallel. For this, we describe and evaluate a number of graph and hypergraph partitioning algorithms to satisfy our particular objective
Dynamic Load Balancing of Unstructured Computations in Decision Tree Classifiers
 In The 12th International Parallel Processing Symposium, Workshop on High Performance Data Mining
, 1998
"... One of the important problems in data mining is discovering classification models from datasets. Application domains include retail target marketing, fraud detection, and design of telecommunication service plans. Highly parallel algorithms for constructing classification decision trees are desirabl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
One of the important problems in data mining is discovering classification models from datasets. Application domains include retail target marketing, fraud detection, and design of telecommunication service plans. Highly parallel algorithms for constructing classification decision trees
CostSensitive Tree of Classifiers
"... Recently, machine learning algorithms have successfully entered largescale realworld industrial applications (e.g. search engines and email spam filters). Here, the CPU cost during testtime must be budgeted and accounted for. In this paper, we address the challenge of balancing the testtime cost ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
Recently, machine learning algorithms have successfully entered largescale realworld industrial applications (e.g. search engines and email spam filters). Here, the CPU cost during testtime must be budgeted and accounted for. In this paper, we address the challenge of balancing the testtime cost
Load balance in the phylogenetic likelihood kernel
 in Parallel Processing, 2009. ICPP’09. International Conference on. IEEE, 2009
"... Abstract—Recent advances in DNA sequencing techniques have led to an unprecedented accumulation and availability of molecular sequence data that needs to be analyzed. This data explosion in combination with the multicore revolution also affects the computational kernels for phylogenetic inference ( ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(reconstruction of evolutionary trees from molecular sequence data) under the widelyused Maximum Likelihood (ML) model. At present, analyses of so called multigene or phylogenomic alignments, i.e., input data sets that comprise concatenated sequence data of several genes, are becoming increasingly popular
Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
 In Proceedings of the Fourth International EUROPAR Conference on Parallel Processing EUROPAR'98, volume 1470 of LNCS
, 1998
"... This paper studies load balancing issues for classes of problems with certain bisection properties. A class of problems has ffbisectors if every problem in the class can be subdivided into two subproblems whose weight is not smaller than an fffraction of the original problem. It is shown that the ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
is proved to be tight. Two strategies to use Algorithm HF for load balancing distributed hierarchical finite element simulations are presented. For this purpose, a certain class of weighted binary trees representing the load of such applications is shown to have 1=4bisectors. This establishes a performance
Results 1  10
of
75