Results 1 - 10 of 2,487

Constructing Good Partitioning Trees

by Bruce Naylor , 1996
"... Partitioning trees, a multi-dimensional generalization of binary search trees, is alone among the principal methods for representing geometry in combining the representation of a set with the geometric search structure required for efficient spatial operations such as set operations and visibility. ..."
Abstract - Cited by 29 (1 self) - Add to MetaCart
. Since a partitioning tree may be interpreted as specifying a program for exploring the structure induced on a space (e.g. by objects), there are many trees which represent the same spatial structure but provide different searches of the space. The issue of generating a good program to determine spatial

PROVABLY GOOD PARTITIONING AND LOAD BALANCING ALGORITHMS FOR PARALLEL ADAPTIVE N-BODY SIMULATION

by Shang-hua Teng , 1998
"... We present an ecient and provably good partitioning and load balancing algorithm for parallel adaptive N-body simulation. The main ingredient of our method is a novel geometric characterization of a class of communication graphs that can be used to support hierarchical N-body methods such as the f ..."
Abstract - Cited by 37 (3 self) - Add to MetaCart
We present an ecient and provably good partitioning and load balancing algorithm for parallel adaptive N-body simulation. The main ingredient of our method is a novel geometric characterization of a class of communication graphs that can be used to support hierarchical N-body methods

New spectral methods for ratio cut partition and clustering

by Lars Hagen, Andrew B. Kahng - IEEE TRANS. ON COMPUTER-AIDED DESIGN , 1992
"... Partitioning of circuit netlists is important in many phases of VLSI design, ranging from layout to testing and hardware simulation. The ratio cut objective function [29] has received much attention since it naturally captures both min-cut and equipartition, the two traditional goals of partitionin ..."
Abstract - Cited by 296 (17 self) - Add to MetaCart
of partitioning. In this paper, we show that the second smallest eigenvalue of a matrix derived from the netlist gives a provably good approx-imation of the optimal ratio cut partition cost. We also dem-onstrate that fast Lanczos-type methods for the sparse sym-metric eigenvalue problem are a robust basis

Analysis of multilevel graph partitioning

by George Karypis, Vipin Kumar , 1995
"... Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide excellent graph partitions. However, there exists little theoretical analysis that could explain the ability of multileve ..."
Abstract - Cited by 106 (12 self) - Add to MetaCart
of multilevel algorithms to produce good partitions. In this paper we present such an analysis. We show under certain reasonable assumptions that even if no refinement is used in the uncoarsening phase, a good bisection of the coarser graph is worse than a good bisection of the finer graph by at most a small

Scalable semantic web data management using vertical partitioning

by Daniel J. Abadi, Adam Marcus, Barton Data - In VLDB , 2007
"... The dataset used for this benchmark is taken from the publicly available Barton Libraries dataset [1]. This data is provided by the Simile Project [3], which develops tools for library data management and interoperability. The data contains records that compose an RDF-formatted dump of the MIT Libra ..."
Abstract - Cited by 190 (6 self) - Add to MetaCart
, these properties appear more often (77 % of the triples have a multi-valued property). The dataset provides a good demonstration of the relatively unstructured nature of Semantic Web data. 2. LONGWELL OVERVIEW Longwell [2] is a tool developed by the Simile Project, which provides a graphical user interface

The parti-game algorithm for variable resolution reinforcement learning in multidimensional state-spaces

by Andrew W. Moore, Christopher G. Atkeson - MACHINE LEARNING , 1995
"... Parti-game is a new algorithm for learning feasible trajectories to goal regions in high dimensional continuous state-spaces. In high dimensions it is essential that learning does not plan uniformly over a state-space. Parti-game maintains a decision-tree partitioning of state-space and applies tec ..."
Abstract - Cited by 255 (9 self) - Add to MetaCart
Parti-game is a new algorithm for learning feasible trajectories to goal regions in high dimensional continuous state-spaces. In high dimensions it is essential that learning does not plan uniformly over a state-space. Parti-game maintains a decision-tree partitioning of state-space and applies

Unbiased recursive partitioning: a conditional inference framework

by Torsten Hothorn, Kurt Hornik, Achim Zeileis , 2004
"... Recursive binary partitioning is a popular tool for regression analysis. Two fundamental problems of exhaustive search procedures usually applied to fit such models have been known for a long time: Overfitting and a selection bias towards covariates with many possible splits or missing values. While ..."
Abstract - Cited by 165 (12 self) - Add to MetaCart
unified framework for recursive partitioning which embeds tree-structured regression models into a well defined theory of conditional inference procedures. Stopping criteria based on multiple test procedures are implemented and it is shown that the predictive performance of the resulting trees is as good

Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers

by Manish Gupta, Prithviraj Banerjee - IEEE Transactions on Parallel and Distributed Systems , 1992
"... An important problem facing numerous research projects on parallelizing compilers for distributed memory machines is that of automatically determining a suitable data partitioning scheme for a program. Most of the current projects leave this tedious problem almost entirely to the user. In this paper ..."
Abstract - Cited by 160 (17 self) - Add to MetaCart
An important problem facing numerous research projects on parallelizing compilers for distributed memory machines is that of automatically determining a suitable data partitioning scheme for a program. Most of the current projects leave this tedious problem almost entirely to the user

Secure web application via automatic partitioning

by Stephen Chong, Jed Liu, Andrew C. Myers, Xin Qi, K. Vikram, Lantian Zheng, Xin Zheng - In SOSP ’07 , 2007
"... Swift is a new, principled approach to building web applications that are secure by construction. In modern web applications, some application functionality is usually implemented as client-side code written in JavaScript. Moving code and data to the client can create security vulnerabilities, but c ..."
Abstract - Cited by 133 (10 self) - Add to MetaCart
, but currently there are no good methods for deciding when it is secure to do so. Swift automatically partitions application code while providing assurance that the resulting placement is secure and efficient. Application code is written as Java-like code annotated with information flow policies that specify

Geometric Mesh Partitioning: Implementation and Experiments

by John R. Gilbert, Gary L. Miller, Shang-Hua Teng
"... We investigate a method of dividing an irregular mesh into equal-sized pieces with few interconnecting edges. The method’s novel feature is that it exploits the geometric coordinates of the mesh vertices. It is based on theoretical work of Miller, Teng, Thurston, and Vavasis, who showed that certain ..."
Abstract - Cited by 112 (20 self) - Add to MetaCart
that certain classes of “well-shaped” finite element meshes have good separators. The geometric method is quite simple to implement: we describe a Matlab code for it in some detail. The method is also quite efficient and effective: we compare it with some other methods, including spectral bisection.
Results 1 - 10 of 2,487