In this paper, we investigate different partitioning schemes for local appearance-based face recognition. Five different salient regionbased partitioning approaches are analyzed and they are compared to a generic partitioning scheme. Extensive experiments have been conducted on the AR, CMU PIE, FRGC, Yale B, and Extend Yale B face databases. The experimental results show that generic partitioni...

Several strategies have been proposed to assign substitution models in phylogenomic datasets, or partitioning. The accuracy of these methods, and most importantly, their impact on phylogenetic estimation has not been thoroughly assessed using computer simulations. We simulated multiple partitioning scenarios to benchmark two a priori partitioning schemes (one model for the whole alignment, one ...

Hardware-software partitioning in an embedded multiprocessor field programmable gate array (FPGA) system is difficult as such systems are uncertain and constraints are various. Moreover, the effect of relational degree for each partitioning combination of system constraints is too difficult analysis to determine a partitioning result. This work applies grey relational analysis to identify a par...

A semi-partitioning technique is presented for efficient scheduling of sporadic task systems on multiprocessors. The presented technique performs in the same manner as the traditional partitioning, as long as tasks are successfully partitioned, but a task is allowed to be shared among multiple processors for its execution, if a spare capacity of every individual processor is not enough to accep...

Several strategies have been proposed to assign substitution models in phylogenomic datasets, or partitioning. The accuracy of these methods, and most importantly, their impact on phylogenetic estimation has not been thoroughly assessed using computer simulations. We simulated multiple partitioning scenarios to benchmark two a priori partitioning schemes (one model for the whole alignment, one ...

In FM algorithm initial partitioning matrix of the given circuit is assigned randomly, as a result for larger circuit having hundred or more nodes will take long time to arrive at the final partition if the initial partitioning matrix is close to the final partitioning then the computation time (iteration) required is small . Here we have proposed novel approach to arrive at initial partitionin...

Partitioning plays an increasingly very important role in the physical design process of VLSI circuits and systems. There are partitioning problems to be solved on all levels of abstraction. The available algorithm technology determines how effectively we can address a given partitioning formulation and optimize a given objective. In 3D, the partitioned units are assigned to a particular layer....

A Vertical Partitioning is the process of dividing the attributes of a relation. Further, a good Vertical Partitioning puts frequently accessed attributes of the relation together in a fragment. Various researchers have proposed different algorithms for Vertical Partitioning. Still, there is a scope of improvement in previous algorithms for Vertical Partitioning. In this paper a new algorithm i...

This paper discusses the various circuit partitioning problems. Circuit partitioning is a well known NP hard problem. The algorithms can partition circuit into number of sub-circuits. Different design styles of circuits have different objectives for the partitioning. Genetic algorithm for circuit partitioning is discussed in this paper. The objective of the Genetic Algorithm is to find an optim...