Results 11 to 20 of about 517,969 (263)
On Specific Factors in Graphs [PDF]
Graphs and Combinatorics, 2020 AbstractIt is well known that if $$G = (V, E)$$ G = ( V , E ) is a connected multigraph and $$X\subset V$$ X ⊂ V is a subset of even order, then G contains a spanning forest H such that each vertex from X has an odd degree in H and all the other vertices have an even degree in H. This spanning forest may have isolated vertices.
Csilla Bujtás +2 more
openaire +4 more sources
Factorized Graph Matching [PDF]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2012 Graph matching plays a central role in solving correspondence problems in computer vision. Graph matching problems that incorporate pair-wise constraints can be cast as a quadratic assignment problem (QAP). Unfortunately, QAP is NP-hard and many algorithms have been proposed to solve different relaxations. This paper presents factorized graph matching (
Feng Zhou 0002, Fernando De la Torre
openaire +2 more sources
Factor-Graph-Aided Three-Dimensional Faster Cooperative Positioning Algorithm
IEEE Access, 2021 With the development of smart cities and 5G applications, there is an increasingly urgent need for cooperative positioning among all kinds of intelligent terminals.
Chengkai Tang +4 more
doaj +1 more source
1‐Factorizations of pseudorandom graphs [PDF]
Random Structures & Algorithms, 2018 A 1‐factorization of a graph G is a collection of edge‐disjoint perfect matchings whose union is E(G). In this paper, we prove that for any ϵ>0, an (n,d,λ)‐graph G admits a 1‐factorization provided that n is even, C0 ≤ d ≤ n−1 (where C0=C0(ϵ) is a constant depending only on ϵ), and λ ≤ d1−ϵ. In particular, since (as is well known) a typical random d‐
Ferber, Asaf, Jain, Vishesh
openaire +4 more sources
Constructing Dynamic Topic Models Based on Variational Autoencoder and Factor Graph
IEEE Access, 2018 Topic models are widely used in various fields of machine learning and statistics. Among them, the dynamic topic model (DTM) is the most popular time-series topic model for the dynamic representations of text corpora.
Zhinan Gou +4 more
doaj +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
Inference Attacks on Genomic Data Based on Probabilistic Graphical Models
Big Data Mining and Analytics, 2020 The rapid progress and plummeting costs of human-genome sequencing enable the availability of large amount of personal biomedical information, leading to one of the most important concerns — genomic data privacy. Since personal biomedical data are highly
Zaobo He, Junxiu Zhou
doaj +1 more source
Discrete Mathematics, 1990 Let a factoring of a graph G into pairwise edge-disjoint factors \(G_ 1,...,G_ t\) be given; each of these factors contains all vertices of G. A subset \(D_ f\) of the vertex set of G is called a factor dominating set, if it is a dominating set for all the factors \(G_ 1,...,G_ t\).
Brigham, Robert C., Dutton, Ronald D.
openaire +3 more sources
A factor graph based genetic algorithm
International Journal of Applied Mathematics and Computer Science, 2014 We propose a new linkage learning genetic algorithm called the Factor Graph based Genetic Algorithm (FGGA). In the FGGA, a factor graph is used to encode the underlying dependencies between variables of the problem.
Helmi B. Hoda +2 more
doaj +1 more source
A New MRF-Based Lossy Compression for Encrypted Binary Images
IEEE Access, 2020 Although there exist many researches on the compression of original non-encrypted binary images, few approaches focus on the compression of encrypted binary images.
Chuntao Wang +3 more
doaj +1 more source