In semi-supervised learning (SSL), we learn a predictive model from a collection of labeled data and a typically much larger collection of unlabeled data. These lecture notes present a framework called multi-view point cloud regularization (MVPCR) [5], which unifies and generalizes several semi-supervised kernel methods that are based on data-dependent regularization in reproducing kernel Hilbe...

Semi-structured data has become prevalent with the growth of the Internet and other on-line information repositories. Many organizational databases are presented on the web as semi-structured data. Designing a \good" semi-structured database is increasingly crucial to prevent data redundancy, inconsistency and updating anomalies. In this paper, we deene a semi-structured schema graph and identi...

This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...

In semi-supervised learning (SSL), we learn a predictive model from a collection of labeled data and a typically much larger collection of unlabeled data. These lecture notes present a framework called multi-view point cloud regularization (MVPCR) [5], which unifies and generalizes several semi-supervised kernel methods that are based on data-dependent regularization in reproducing kernel Hilbe...

Efficient learning of 3D shape representation from point cloud is one the biggest requirements in computer vision. In recent years, convolutional neural networks have achieved great success 2D image learning. However, unlike images that a Euclidean structure, clouds are irregular since neighbors each node inconsistent. Many studies tried to develop various graph overcome this problem and achiev...

The median graph has been shown to be a good choice to obtain a representative of a set of graphs. However, its computation is a complex problem. Recently, graph embedding into vector spaces has been proposed to obtain approximations of the median graph. The problem with such an approach is how to go from a point in the vector space back to a graph in the graph space. The main contribution of t...

We define four families of geometries with as point graph the graph — or its complement — of all elliptic 4 hyperplanes of a given parabolic quadric in any finite 6-dimensional projective space, where adjacency is 5 given by intersecting in a tangent 4-space. One of the classes consists of semi-partial geometries constructed 6 in J.A. Thas [SPG-reguli and semipartial geometries, Adv. Geom. 1 (2...

Fuzzy total chromatic number is the least value of k such that k-fuzzy coloring exist. In this paper, we discussed concept graphs to bistar graph and helm graph. Here define fuzzy Bistar Helm

In this paper, we study generalized quasi-variational relation problems in locally G-convex spaces. Using the Kakutani-Fan-Glicksberg fixed-point theorem for upper semicontinuous set-valued mapping with nonempty closed acyclic values, we establish an existence theorem of a solution set for these problems. Moreover, the stability and closedness of the solution set for these problems are also obt...