Search Results

Graph Neural Networks (GNNs) have achieved promising performance in a variety of practical applications. Similar to traditional DNNs, GNNs could exhibit incorrect behavior that may lead to severe consequences, and thus testing is necessary and crucial. ...

Labeling issues with the skills required to complete them can help contributors to choose tasks in Open Source Software projects. However, manually labeling issues is time-consuming and error-prone, and current automated approaches are mostly ...

Natural language processing (NLP) shows promise as a means to automate the labelling of hospital-scale neuroradiology magnetic resonance imaging (MRI) datasets for computer vision applications. To date, however, there has been no thorough ...

Unsupervised anomaly detection in an n-length univariate time series often comes with high risk. Anomaly contextual dependencies limit the application of binary classification methods. Analyzing the statistical features of data may help enrich the ...

We consider a population of agents whose preference types are unobservable but imperfectly correlated with certain observable labels such as customs, languages, and origins. In addition, the matching process exhibits homophily: agents tend to ...

The PLF approach can be easily applied to different management aspects.Sounds and images are the most widely used PLF monitoring strategies.Labelling is a manual audio-visual analysis of the data collected at farm level.Accurate labelling procedure is ...

Feder and Subi conjectured that for any 2-coloring of the edges of the n-dimensional cube, there is an antipodal pair of vertices connected by a path that changes color at most once. They proved that if the coloring is such that there are no properly ...

Customer profiles are, by definition, made up of factual and transactional data. It is often the case that due to reasons such as high cost of data acquisition and/or protection, only the transactional data are available for data mining operations. ...

Nowadays, movies, video, audio and games have a strong presence in human life, being a massive source of entertainment. Increasingly, movies and videos are becoming accessible as enormous collections over the Internet, in social media and interactive TV,...

A finite simple graph G is called a sum graph (respectively, integral sum graph) if there is a bijectionf from the vertices of G to a set of positive integers S (respectively, a set of integers S) such that uv is an edge of G if and only if f(u)+f(v)@?...

Let i 1 ≥ i 2 ≥ i 3 ≥ 1 be integers. An L ( i 1 , i 2 , i 3 )-labelling of a graph G = ( V , E ) is a mapping ϕ : V → { 0 , 1 , 2 , … } such that | ϕ ( u ) − ϕ ( v ) | ≥ i t for any u , v ∈ V with d ( u , v ) = t, t = 1 , 2 , 3, where ...

The (d,1)-total number @l"d^T(G) of a graph G is the width of the smallest range of integers that suffices to label the vertices and the edges of G such that no two adjacent vertices have the same label, no two incident edges have the same label and the ...

An antimagic labelling of a finite undirected simple graph with m edges and n vertices is a bijection from the set of edges to the integers 1,...,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges ...

We propose two new methods to label connected components based on iterative recursion: one directly labels an original binary image while the other labels the boundary voxels followed by one-pass labelling of non-boundary object voxels. The novelty of ...