Results 41 to 50 of about 5,808,675 (298)
To achieve a good trade-off between the data-embedding payload and the data-embedding distortion, mainstream reversible data hiding (RDH) algorithms perform data embedding on a well-built prediction error histogram.
Limengnan Zhou +3 more
doaj +1 more source
Optimal regular graph designs [PDF]
A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many optimality results and, if the number of blocks is large enough, they are A- and D-optimal.
openaire +3 more sources
Orienting graphs to optimize reachability [PDF]
The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to minimize the number of such pairs. The paper describes a quadratic-time algorithm for the first problem, and a proof
Hakimi, S Louis +2 more
openaire +4 more sources
Distributed Optimization for Graph Matching
Graph matching, or the determination of the vertex correspondences between a pair of graphs, is a crucial task in various problems in different science and engineering disciplines. This article aims to propose a distributed optimization approach for graph matching (GM) between two isomorphic graphs over multiagent networks. For this, we first show that
Quoc Van Tran +3 more
openaire +2 more sources
Differentiable Factor Graph Optimization for Learning Smoothers [PDF]
A recent line of work has shown that end-to-end optimization of Bayesian filters can be used to learn state estimators for systems whose underlying models are difficult to hand-design or tune, while retaining the core advantages of probabilistic state ...
Brent Yi +4 more
semanticscholar +1 more source
Optimal Potentials for Quantum Graphs [PDF]
Let $\Gamma = (V,E)$ is a metric graph, where the set of edges $E=\bigcup\limits_{n=1}^N \{e_n\}$ consists of distinct real intervals $e_n= [x_{2n-1}, x_{2n}]$, while the set of vertices is a partition of the endpoints of the intervals. On the edges of any metric graph consider the Schrödinger operator $-\frac{d^2}{dx^2}+q(x), q\in L^1(\Gamma) $ with ...
Pavel Kurasov, Andrea Serio
openaire +1 more source
Improved IMU Preintegration with Gravity Change and Earth Rotation for Optimization-Based GNSS/VINS
IMU preintegration technology has been widely used in the optimization-based sensor fusion framework, in order to avoid reintegrating the high-frequency IMU measurements at each iteration and maintain the ability of bias correction when bias estimation ...
Junxiang Jiang, Xiaoji Niu, Jingnan Liu
doaj +1 more source
MRF optimization by graph approximation [PDF]
Graph cuts-based algorithms have achieved great success in energy minimization for many computer vision applications. These algorithms provide approximated solutions for multi-label energy functions via move-making approach. This approach fuses the current solution with a proposal to generate a lower-energy solution.
Kim, Wonsik, Lee, Kyoung Mu
openaire +2 more sources
Graph Query Processing Technology Based on Data Warehouse [PDF]
The maturity of technologies such as vectorization provides an opportunity to realize graph queries based on a data warehouse.However, the existing system does not consider the characteristics of columnar storage and queries and fails to efficiently ...
Jiading GUO, Peng WANG
doaj +1 more source
A Versatile Mapping Approach for Technology Mapping and Graph Optimization
This paper proposes a versatile mapping approach that has three objectives: i) it can map from one technology-independent graph representation to another; ii) it can map to a cell library; iii) it supports logic rewriting.
A. Calvino +4 more
semanticscholar +1 more source

