Results 41 to 50 of about 720,784 (299)
Conditional gradients for total variation regularization with PDE constraints: a graph cuts approach
, 2023 <p>This module solves a PDE-constrained minimization problem with TV-regularization, using the method described in the paper "Conditional gradients for total variation regularization with PDE constraints: a graph cuts approach".</p ...
Iglesias, José A. +2 more
core +1 more source
Remote Sensing, 2022 Due to the great benefit of rich spectral information, hyperspectral images (HSIs) have been successfully applied in many fields. However, some problems of concern also limit their further applications, such as high dimension and expensive labeling.
Lei Pan +5 more
doaj +1 more source
JONNEE: Joint Network Nodes and Edges Embedding
IEEE Access, 2021 Recently, graph embedding models significantly improved the quality of graph machine learning tasks, such as node classification and link prediction. In this work, we propose a model called JONNEE (JOint Network Nodes and Edges Embedding), which learns ...
Ilya Makarov +2 more
doaj +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 +4 more sources
Feature representation via graph-regularized entropy-weighted nonnegative matrix factorization [PDF]
AUT Journal of Mathematics and ComputingFeature extraction plays a crucial role in dimensionality reduction in machine learning applications. Nonnegative Matrix Factorization (NMF) has emerged as a powerful technique for dimensionality reduction; however, its equal treatment of all features ...
Hazhir Sohrabi +2 more
doaj +1 more source
On orbital regular graphs and frobenius graphs
Discrete 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
Graph-based regularization for spherical signal interpolation [PDF]
, 2010 This paper addresses the problem of the interpolation of 2-d spherical signals from non-uniformly sampled and noisy data. We propose a graph-based regularization algorithm to improve the signal reconstructed by local interpolation methods such as nearest
Pascal Frossard +3 more
core +2 more sources
ArrayTraditional wet experiments to identify drug–target interactions (DTIs) are costly and time consuming. Therefore, machine learning-based methods are commonly used to speed up the identification process.
Junjun Zhang, Tingfeng Zeng
doaj +1 more source
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
Regular factors in regular graphs
Discrete 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 +3 more sources