Results 31 to 40 of about 117,362 (280)

Numerical multi-loop calculations with the program SecDec [PDF]

open access: yes, 2014
SecDec is a program which can be used for the evaluation of parametric integrals, in particular multi-loop integrals. For a given set of propagators defining the graph, the program constructs the graph polynomials, factorizes the endpoint singularities ...
Borowka, Sophia, Heinrich, Gudrun
core   +2 more sources

Quadratically-Regularized Optimal Transport on Graphs

open access: yes, 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

On regular graphs. II

open access: yesJournal 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

On orbital regular graphs and frobenius graphs

open access: yesDiscrete Mathematics, 1998
A group is a Frobenius group if it acts transitively but not freely on a set such that no two elements are fixed by a non-trivial element of the group. An orbital-regular graph is a finite graph whose automorphism group has a subgroup which is transitive on the edges and contains no element which fixes two vertices.
Xin Gui Fang   +2 more
openaire   +2 more sources

On extension of regular graphs [PDF]

open access: yesJournal of Discrete Mathematical Sciences and Cryptography, 2018
arXiv admin note: substantial text overlap with arXiv:1407 ...
Banerjee, Anirban, Bej, Saptarshi
openaire   +2 more sources

A simplifying feature of the heterotic one loop four graviton amplitude

open access: yesPhysics 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

A Markov Random Field and Adaptive Regularization Embedded Level Set Segmentation Model Solving by Graph Cuts

open access: yesJournal 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

Global-Local Consistency Constrained Deep Embedded Clustering for Hyperspectral Band Selection

open access: yesIEEE Access, 2023
Hyperspectral band selection plays a key role for overcoming the curse of dimensionality in the classification of hyperspectral remote sensing images (HSIs).
Shangfeng Ning, Wenhong Wang
doaj   +1 more source

Light Field Super-Resolution Via Graph-Based Regularization

open access: yes, 2017
Light field cameras capture the 3D information in a scene with a single exposure. This special feature makes light field cameras very appealing for a variety of applications: from post-capture refocus, to depth estimation and image-based rendering ...
Frossard, Pascal, Rossi, Mattia
core   +1 more source

Regular factors in regular graphs

open access: yesDiscrete Mathematics, 1993
The author shows that a \(k\)-regular \((k-1)\)-edge-connected graph with an even number of vertices has an \(m\)-factor not containing \(k-m\) arbitrarily prescribed edges whenever \(1\leq m\leq k-1\). This was known only for \(m=1\) or \(k-1\). Also the sharpness of this result and some corollaries are given.
openaire   +2 more sources

Home - About - Disclaimer - Privacy