Results 31 to 40 of about 845,204 (303)
Graph Embedding Matrix Sharing With Differential Privacy
IEEE Access, 2019 Graph embedding maps a graph into low-dimensional vectors, i.e., embedding matrix, while preserving the graph structure, solving the high computation and space cost for graph analysis.
Sen Zhang, Weiwei Ni
doaj +1 more source
whole-graph-embedding-for-polycentricity
, 2022 Conventional polycentricity scores and embedding vectors of UB ...
Cheng Fu (8354925)
core +1 more source
A Toroidal Maxwell–Cremona–Delaunay Correspondence
Journal of Computational Geometry, 2022 We consider three classes of geodesic embeddings of graphs on Euclidean flat tori: • A toroidal graph embedding Γ is positive equilibrium if it is possible to place positive weights on the edges, such that the weighted edge vectors incident to each ...
Jeff Erickson, Patrick Lin
doaj +1 more source
Improved Skip-Gram Based on Graph Structure Information
Sensors, 2023 Applying the Skip-gram to graph representation learning has become a widely researched topic in recent years. Prior works usually focus on the migration application of the Skip-gram model, while Skip-gram in graph representation learning, initially ...
Xiaojie Wang, Haijun Zhao, Huayue Chen
doaj +1 more source
Nonlinear Dynamic Field Embedding: On Hyperspectral Scene Visualization [PDF]
, 2012 In many areas of research, complex signals are commonly represented by high dimensional feature vectors. However, high dimensional vectors are difficult to analyze and interpret due to the curse of dimensionality.
Lunga, Dalton, Erosy, Okan
core +1 more source
Uniform graph embedding into metric spaces [PDF]
Компьютерные исследования и моделирование, 2012 The task of embedding an infinity countable graph into continuous metric space is considered. The concept of uniform embedding having no accumulation point in a set of vertex images and having all graph edge images of a limited length is introduced ...
A. V. Koganov
doaj +1 more source
Embedding Graphs into Two-Dimensional Simplicial Complexes
Computing in Geometry and Topology, 2022 We consider the problem of deciding whether an input graph G admits a topological embedding into an input two-dimensional simplicial complex C. This problem includes, among others, the embeddability problem of a graph on a surface and the topological ...
Éric Colin de Verdière +2 more
doaj +1 more source
Ars Mathematica Contemporanea, 2019 Summary: Let \(G\) be a ribbon graph and \(\mu (G)\) be the number of components of the virtual link formed from \(G\) as a cellularly embedded graph via the medial construction. In this paper we first prove that \(\mu (G) \leq f(G) + \gamma (G)\), where \(f(G)\) and \(\gamma (G)\) are the number of boundary components and Euler genus of \(G ...
Jin, Xian'an, Yan, Qi
openaire +3 more sources
Spectral embedding of graphs [PDF]
Pattern Recognition, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bin Luo 0001 +2 more
openaire +3 more sources
Distance measures for embedded graphs [PDF]
Computational Geometry, 2021 We introduce new distance measures for comparing straight-line embedded graphs based on the Fréchet distance and the weak Fréchet distance. These graph distances are defined using continuous mappings and thus take the combinatorial structure as well as the geometric embeddings of the graphs into account.
Hugo A. Akitaya +4 more
openaire +7 more sources