Results 11  20
of
74,113
Frobenius adjacency algebras of association schemes
"... The concept of adjacency algebras of association schemes is a generalization of group algebras of finite groups. But adjacency algebras over a positive characteristic field need not be Frobenius algebras. In this article, we characterize association schemes whose adjacency algebras are Frobenius or ..."
Abstract
 Add to MetaCart
The concept of adjacency algebras of association schemes is a generalization of group algebras of finite groups. But adjacency algebras over a positive characteristic field need not be Frobenius algebras. In this article, we characterize association schemes whose adjacency algebras are Frobenius
Bidirectional Label Propagation over Graphs
"... Abstract GraphBased label propagation algorithms are popular in the stateoftheart semisupervised learning research. The key idea underlying this algorithmic family is to enforce labeling consistency between any two examples with a positive similarity. However, negative similarities or dissimila ..."
Abstract
 Add to MetaCart
Abstract GraphBased label propagation algorithms are popular in the stateoftheart semisupervised learning research. The key idea underlying this algorithmic family is to enforce labeling consistency between any two examples with a positive similarity. However, negative similarities
Online Partitioning of MultiLabeled Graphs∗
"... Graph partitioning is an old problem that is finding renewed interest in the era of big, complex datasets and parallel computing frameworks that can benefit from a proper partitiong of big graph data across multiple nodes in a cluster. In this paper we look into a specific instance of the problem t ..."
Abstract
 Add to MetaCart
termed online graph partitioning that addresses the need to partition large graphs that do not fit in main memory. A neglected aspect of modern graph datasets is that real graphs have labels! Node labels may, for instance, correspond to categorical attributes (such as country, profession, participating
On L(0,1)Labelling of Cactus Graphs
 Communications and Network
, 2012
"... Anlabelling of a graph is an assignment of nonnegative integers to the vertices of such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference between the labels assigned to any two vertices which are at distance two is at least one. The sp ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Anlabelling of a graph is an assignment of nonnegative integers to the vertices of such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference between the labels assigned to any two vertices which are at distance two is at least one
On the ith Graphs of the Johnson Scheme
"... Abstract: Let n and k be fixed positive integers. The Johnson Graph G(n,k),also known as the slice of the cube, or the graph of the Johnson Scheme of the first order is the undirected graph where the vertices are all the ksubsets of a fixed nset. Two vertices A and B are adjacent if and only if  ..."
Abstract
 Add to MetaCart
Abstract: Let n and k be fixed positive integers. The Johnson Graph G(n,k),also known as the slice of the cube, or the graph of the Johnson Scheme of the first order is the undirected graph where the vertices are all the ksubsets of a fixed nset. Two vertices A and B are adjacent if and only
Odd Graceful Labeling of Some New Graphs
"... In this work some new odd graceful graphs are investigated. We prove that the graph obtained by joining two copies of even cycle Cn with path Pk and two copies of even cycle Cn sharing a common edge are odd graceful graphs. In addition to this we derive that the splitting graph of K1, n as well as t ..."
Abstract
 Add to MetaCart
In this work some new odd graceful graphs are investigated. We prove that the graph obtained by joining two copies of even cycle Cn with path Pk and two copies of even cycle Cn sharing a common edge are odd graceful graphs. In addition to this we derive that the splitting graph of K1, n as well
Noname manuscript No. (will be inserted by the editor) Mutilabel MRFs with Label Adjacency Constraint: Globally Optimal Solutions and Applications
"... Abstract This work addresses the problem of optimally solving Markov Random Fields(MRFs) in which labels obey a certain topology constraint. Utilizing prior information, such as domain knowledge about the appearance, shape, or spatial configuration of objects in a scene can greatly improve the acc ..."
Abstract
 Add to MetaCart
. In this work, we propose a new methodology to segment a special class of images, which exhibit nested layer topologies often encountered in biomedical applications. The segmentation problem is modeled using multilabel Markov Random Fields with an additional label adjacency constraint (LAC). The multilabel
Measuring Effectiveness of Address Schemes for ASlevel Graphs
, 2012
"... This Doctoral Dissertation is brought to you for free and open access by the Computer Science at UKnowledge. It has been accepted for inclusion in Theses and DissertationsComputer Science by an authorized administrator of UKnowledge. For more information, please contact ..."
Abstract
 Add to MetaCart
This Doctoral Dissertation is brought to you for free and open access by the Computer Science at UKnowledge. It has been accepted for inclusion in Theses and DissertationsComputer Science by an authorized administrator of UKnowledge. For more information, please contact
Results 11  20
of
74,113