We present new concepts to integrate logic synthesis and physical design. Our methodology uses general Boolean transformations as known from technology-independent synthesis, and a recursive bi-partitioning placement algorithm. In each partitioning step, the precision of the layout data increases. This allows effective guidance of the logic synthesis operations for cycle time optimization. An a...

Many music information retrieval tasks require finding the nearest neighbors of a query item in a high-dimensional space. However, the complexity of computing nearest neighbors grows linearly with size of the database, making exact retrieval impractical for large databases. We investigate modern variants of the classical KD-tree algorithm, which efficiently index high-dimensional data by recurs...

In this paper, we present several heterogeneous partitioning algorithms for parallel numerical applications. The goal is to adapt the partitioning to dynamic and unpredictable load changes on the nodes. The methods are based on existing homogeneous algorithms like orthogonal recursive bisection, parallel strips, and scattering. We apply these algorithms to a parallel numerical application in a ...

From the review, it is studied that the min cut k – partitioning problem is a fundamental partitioning problem and is NP hard also. Most of the existing partitioning algorithms are heuristic in nature and they try to find a reasonably good solution. These algorithms falls in move – based category in which solution is generated iteratively from an initial solution applying move to the recent sol...

Graph partitioning with preferences is one of the data distribution models for parallel computer, where partitioning and mapping are generated together. It improves the overall throughput of message traffic by having communication restricted to processors which are near each other, whenever possible. This model is obtained by associating to each vertex a value which reflects its net preference ...

An improved method for exhaustively identifying common pharmacophores from a given list of 3D conformers is proposed. The method partitions feature lists into multidimensional boxes according to the distances between the pharmacophore centers. Unlike some existing techniques, each feature list is mapped into multiple boxes to ensure that good matches will never be missed due to the partitioning...