Results 11 to 20 of about 265,994 (263)
Numerical Treatment of a Data Completion Problem in Heat Conduction Modelling [PDF]
Journal of Universal Computer Science, 2020 This work deals with a question in the mathematical modelling for the temperature evolution in a bar, for a long time linked as an inverse problem. The onedimensional model is the parabolic partial differential equation ut = α uxx, known as the heat ...
Augusto C. de Castro Barbosa +3 more
doaj +3 more sources
Completion and deficiency problems [PDF]
Journal of Combinatorial Theory, Series B, 2020 Given a partial Steiner triple system (STS) of order $n$, what is the order of the smallest complete STS it can be embedded into? The study of this question goes back more than 40 years. In this paper we answer it for relatively sparse STSs, showing that given a partial STS of order $n$ with at most $r \le \varepsilon n^2$ triples, it can always be ...
Rajko Nenadov +2 more
openaire +4 more sources
The Totally Positive Completion Problem: The 3-by-n Case
Special Matrices, 2021 The 3-by-n TP-completable patterns are characterized by identifying the minimal obstructions up to natural symmetries. They are finite in number.
Carter D. +4 more
doaj +1 more source
Completion of the Causal Completability Problem [PDF]
The British Journal for the Philosophy of Science, 2015 We give a few results concerning the notions of causal completability and causal closedness of classical probability spaces (Hofer-Szabo, Redei & Szabo [1999], Gyenis & Redei [2004]). Answering a question from Hofer-Szabo et al. [1999], we prove that any classical probability space has a causally closed extension. We also employ the notion of causal up-
Wroński, Leszek, Marczyk, Michał
openaire +2 more sources
A parallel multi‐block alternating direction method of multipliers for tensor completion
IET Image Processing, 2021 This paper proposes an algorithm for the tensor completion problem of estimating multi‐linear data under the limitation of observation rate. Many tensor completion methods are based on nuclear norm minimization, they may fail to achieve the global ...
Hu Zhu +5 more
doaj +1 more source
A Nonconvex Method to Low-Rank Matrix Completion
IEEE Access, 2022 In recent years, the problem of recovering a low-rank matrix from partial entries, known as low-rank matrix completion problem, has attracted much attention in many applications.
Haizhen He +3 more
doaj +1 more source
Discrete Dynamics in Nature and Society, 2021 This paper considers the combination of the general sum-of-processing-time effect and position-dependent effect on a single machine. The actual processing time of a job is defined by functions of the sum of the normal processing times of the jobs ...
Kunping Shen, Yuke Chen, Shangchia Liu
doaj +1 more source
Unsupervised Depth Completion Guided by Visual Inertial System and Confidence
Sensors, 2023 This paper solves the problem of depth completion learning from sparse depth maps and RGB images. Specifically, a real-time unsupervised depth completion method in dynamic scenes guided by visual inertial system and confidence is described.
Hanxuan Zhang, Ju Huo
doaj +1 more source
Rank-Adaptive Tensor Completion Based on Tucker Decomposition
Entropy, 2023 Tensor completion is a fundamental tool to estimate unknown information from observed data, which is widely used in many areas, including image and video recovery, traffic data completion and the multi-input multi-output problems in information theory ...
Siqi Liu, Xiaoyu Shi, Qifeng Liao
doaj +1 more source
The HOM Problem is EXPTIME-Complete [PDF]
2012 27th Annual IEEE Symposium on Logic in Computer Science, 2012 The HOM problem questions whether the image of a given regular tree language through a given tree homomorphism is also regular. Decidability of HOM is an important theoretical question which was open for a long time. Recently, HOM has been proved decidable with a triple exponential time algorithm.
Creus López, Carles +3 more
openaire +4 more sources