Results 31 to 40 of about 115,711 (260)
Querying Regular Graph Patterns [PDF]
Journal of the ACM, 2014 Graph data appears in a variety of application domains, and many uses of it, such as querying, matching, and transforming data, naturally result in incompletely specified graph data, that is, graph patterns. While queries need to be posed against such data, techniques for querying patterns are generally lacking, and properties of such queries are not ...
Barcelo, Pablo +2 more
openaire +6 more sources
A simplifying feature of the heterotic one loop four graviton amplitude
Physics Letters B, 2018 We show that the weight four modular graph functions that contribute to the integrand of the t8t8D4R4 term at one loop in heterotic string theory do not require regularization, and hence the integrand is simple.
Anirban Basu
doaj +1 more source
AIMS Mathematics, 2023 As a popular dimensionality reduction technique, concept factorization (CF) has been widely applied in image clustering. However, CF fails to extract the intrinsic structure of data space and does not utilize the label information.
Yuelin Gao +3 more
doaj +1 more source
Arbitrarily regularizable graphs [PDF]
, 2017 A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null.
BOZZO, Enrico, FRANCESCHET, Massimo
core +2 more sources
Quadratically-Regularized Optimal Transport on Graphs
, 2018 Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to express challenging
Essid, Montacer, Solomon, Justin
core +1 more source
Journal of Combinatorial Theory, Series B, 1971 AbstractThis paper is a continuation of [1] and we shall use the same terminology. The main result of this part is the following: Suppose that the automorphism group of a connected graph of valency p + 1, p a prime, has a subgroup which acts as a regular permutation group on the set of s-arcs of the graph. Then s ≤ 7 and s ≠ 6.
openaire +3 more sources
Hamiltonian Strongly Regular Graphs [PDF]
SSRN Electronic Journal, 2008 We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.
Brouwer, A.E., Haemers, W.H.
openaire +5 more sources
Journal of Electrical and Computer Engineering, 2019 This paper presents a novel Markov random field (MRF) and adaptive regularization embedded level set model for robust image segmentation and uses graph cuts optimization to numerically solve it.
Dengwei Wang
doaj +1 more source
Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain
, 2017 Inverse imaging problems are inherently under-determined, and hence it is important to employ appropriate image priors for regularization. One recent popular prior---the graph Laplacian regularizer---assumes that the target pixel patch is smooth with ...
Cheung, Gene, Pang, Jiahao
core +2 more sources
Double regularized matrix factorization for image classification and clustering
EURASIP Journal on Image and Video Processing, 2018 Feature selection, which aims to select an optimal feature subset to avoid the “curse of dimensionality,” is an important research topic in many real-world applications.
Wei Zhou +4 more
doaj +1 more source