In this study, the ground state energies of face-centered cubic Hubbard clusters are analyzed using the Lanczos method. Examination of the ground state energy as a function of the number of particle per site n showed an energy minimum for face-centered cubic structures. This energy minimum decreased in n with increasing coulombic interaction parameter U. We found that the ground state energy ha...

Eye detection is an important step for a range of applications such as iris and face recognition. For eye detection in practice, speed is as equally important as accuracy. In this paper, we propose a super-fast (1000 fps on a general PC) eye detection method based on the label map of the raw image without face detection. We firstly produce the label map of a raw image according to the coordinat...

Face recognition in real-world images mostly relies on three successive steps: face detection, alignment and identification. The second step of face alignment is crucial as the bounding boxes produced by robust face detection algorithms are still too imprecise for most face recognition techniques, i.e. they show slight variations in position, orientation and scale. We present a novel technique ...

The paper presents a comparative study of performance for face recognition algorithms in order to select the algorithms that have the highest performance and overcome the problems faced in recognition due to plastic surgery. A plastic surgery database that contains face images with different types of surgeries is used.. The work reports the performance evaluation of eleven photometric illuminat...

The performance of the networks is analyzed based on the routing protocols. Usually routing protocols determine the paths based on the network topology and configuration parameters, and not depend on the traffic load on the routers and links. Routing optimization is done using Genetic Algorithm in Minimum Spanning Tree (MST). By using FACE Routing technique, each node is able to gather the loca...

A convex partition with respect to a point set S is a planar subdivision whose vertices are the points of S, where the boundary of the unbounded outer face is the boundary of the convex hull of S, and every bounded interior face is a convex polygon. A minimum convex partition with respect to S is a convex partition of S such that the number of convex polygons is minimised. In this paper, we wil...

Let G be an edge-weighted planar graph with 2k terminal vertices 5 s1, t1, . . . , sk, tk. The minimum-sum vertex-disjoint paths problem asks for a set of 6 pairwise vertex-disjoint simple paths of minimum total length, where the ith path 7 connects si to ti. Even when all terminals lie on a single face, efficient algorithms 8 for this problem are known only for fixed k ≤ 3. We describe the fir...