Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Fast and robust iterative closest point
The iterative closest point (ICP) algorithm and its variants are a fundamental technique for
rigid registration between two point sets, with wide applications in different areas from …
rigid registration between two point sets, with wide applications in different areas from …
A new generation 99 line Matlab code for compliance topology optimization and its extension to 3D
Compact and efficient Matlab implementations of compliance topology optimization (TO) for
2D and 3D continua are given, consisting of 99 and 125 lines respectively. On …
2D and 3D continua are given, consisting of 99 and 125 lines respectively. On …
Inversion-free geometric map** construction: A survey
A geometric map** establishes a correspondence between two domains. Since no real
object has zero or negative volume, such a map** is required to be inversion-free …
object has zero or negative volume, such a map** is required to be inversion-free …
A proof that Anderson acceleration improves the convergence rate in linearly converging fixed-point methods (but not in those converging quadratically)
This paper provides theoretical justification that Anderson acceleration (AA) improves the
convergence rate of contractive fixed-point iterations in the vicinity of a fixed-point. AA has …
convergence rate of contractive fixed-point iterations in the vicinity of a fixed-point. AA has …
Survey of 3D modeling using depth cameras
Abstract Three-dimensional (3D) modeling is an important topic in computer graphics and
computer vision. In recent years, the introduction of consumer-grade depth cameras has …
computer vision. In recent years, the introduction of consumer-grade depth cameras has …
Anderson Accelerated Douglas--Rachford Splitting
We consider the problem of nonsmooth convex optimization with linear equality constraints,
where the objective function is only accessible through its proximal operator. This problem …
where the objective function is only accessible through its proximal operator. This problem …
Anderson acceleration for contractive and noncontractive operators
A one-step analysis of Anderson acceleration with general algorithmic depths is presented.
The resulting residual bounds within both contractive and noncontractive settings reveal the …
The resulting residual bounds within both contractive and noncontractive settings reveal the …
Limited-control optimal protocols arbitrarily far from equilibrium
Recent studies have explored finite-time dissipation-minimizing protocols for stochastic
thermodynamic systems driven arbitrarily far from equilibrium, when granted full external …
thermodynamic systems driven arbitrarily far from equilibrium, when granted full external …
Accelerating ADMM for efficient simulation and optimization
The alternating direction method of multipliers (ADMM) is a popular approach for solving
optimization problems that are potentially non-smooth and with hard constraints. It has been …
optimization problems that are potentially non-smooth and with hard constraints. It has been …
Fast and robust non-rigid registration using accelerated majorization-minimization
Non-rigid 3D registration, which deforms a source 3D shape in a non-rigid way to align with
a target 3D shape, is a classical problem in computer vision. Such problems can be …
a target 3D shape, is a classical problem in computer vision. Such problems can be …