检索结果-内蒙古大学图书馆

Information and Communication Engineering (JCICE), International Joint Conference on

作者： Ruijun Yang Chu Zhang Yan Cheng School of Computer Science & Information Engineering Shanghai Institute of Technology Shanghai China School of Criminal Justice East China University of Political Science and Law Shanghai China

ISBN: (数字)9798350388725

ISBN: (纸本)9798350388732

Image stitching technology has application scenarios in many fields. At present, the existing algorithms usually use the method of acquisition first and then synthesis, which is still insufficient in real-time performance; in addition, under the premise of real-time acquisition, it is also insufficient to realize continuous image synthesis. To solve this problem, this algorithm uses the RGB module of the Intel Realsense D435 camera for image acquisition, first creates an original image for storing the final result, collects an image at an interval of 100ms each time, and performs 8*8 hashing of the two images before and after Compare the similarity of the value, take the image with a similarity less than 5/8 and keep it, then use the SIFT (Scale-invariant feature transform) scale-invariant feature transform feature detection algorithm to extract the image feature points from the collected image, and use the RANSAC to extract the feature points The (Random Sample consensus) algorithm screens effective points and calculates the homography transformation matrix at the same time. Finally, every two images collected are synthesized into one and covered in the corresponding position of the result image. Through experiments in this paper, the average time for single acquisition and synthesis is 70ms, achieving the real-time goal. The similarity between the experimental group and the control group can reach 70%, and the resolution is increased by 1.65 times, achieving the goal of continuous splicing.

关键词： Image resolution Image synthesis Splicing Feature detection Transforms consensus algorithm Feature extraction Cameras Real-time systems Image stitching

来源：评论

学校读者我要写书评

暂无评论

A Simple 4-Approximation algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees

arXiv

引用

arXiv 2024年

作者： Dempsey, Jordan van Iersel, Leo Jones, Mark Zeh, Norbert Faculty of Computer Science Dalhousie University 6050 University Avenue HalifaxNSB3H 1W5 Canada Delft Institute of Applied Mathematics Delft University of Technology Mekelweg 4 Delft2628 CD Netherlands

We present a simple 4-approximation algorithm for computing a maximum agreement forest of multiple unrooted binary trees. This algorithm applies LP rounding to an extension of a recent ILP formulation of the maximum agreement forest problem on two trees by Van Wersch al. [13]. We achieve the same approximation ratio as the algorithm of Chen et al. [3] but our algorithm is extremely simple. We also prove that no algorithm based on the ILP formulation by Van Wersch et al. can achieve an approximation ratio of 4 − Ε, for any Ε > 0, even on two trees. To this end, we prove that the integrality gap of the ILP approaches 4 as the size of the two input trees grows. © 2024, CC BY.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Faster Combinatorial k-Clique algorithms

arXiv

引用

arXiv 2024年

作者： Abboud, Amir Fischer, Nick Shechter, Yarin Weizmann Institute of Science Rehovot Israel

Detecting if a graph contains a k-Clique is one of the most fundamental problems in computer science. The asymptotically fastest algorithm runs in time O(nωk/3), where ω is the exponent of Boolean matrix multiplication. To date, this is the only technique capable of beating the trivial O(nk) bound by a polynomial factor. Due to this technique’s various limitations, much effort has gone into designing "combinatorial" algorithms that improve over exhaustive search via other techniques. The first contribution of this work is a faster combinatorial algorithm for k-Clique, improving Vassilevska’s bound of O(nk/logk−1 n) by two log factors. Technically, our main result is a new reduction from k-Clique to Triangle detection that exploits the same divide-and-conquer at the core of recent combinatorial algorithms by Chan (SODA’15) and Yu (ICALP’15). Our second contribution is exploiting combinatorial techniques to improve the state-of-the-art (even of non-combinatorial algorithms) for generalizations of the k-Clique problem. Specifically we introduce the first non-trivial clique listing algorithms: A general algorithm for detecting cliques in hypergraphs that also improves the state of the art for detection, and an additional algorithm for the specific case of triangle listing with improved bounds. © 2024, CC BY.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Finite Sample Complexity Analysis of Binary Segmentation

arXiv

引用

arXiv 2024年

作者： Hocking, Toby Dylan

Binary segmentation is the classic greedy algorithm which recursively splits a sequential data set by optimizing some loss or likelihood function. Binary segmentation is widely used for changepoint detection in data sets measured over space or time, and as a sub-routine for decision tree learning. In theory it should be extremely fast for N data and K splits, O(NK) in the worst case, and O(N log K) in the best case. In this paper we describe new methods for analyzing the time and space complexity of binary segmentation for a given finite N, K, and minimum segment length parameter. First, we describe algorithms that can be used to compute the best and worst case number of splits the algorithm must consider. Second, we describe synthetic data that achieve the best and worst case and which can be used to test for correct implementation of the algorithm. Finally, we provide an empirical analysis of real data which suggests that binary segmentation is often close to optimal speed in practice. © 2024, CC BY.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Sampling of Temporal Networks with Preserved Causality Structure

arXiv

引用

arXiv 2025年

作者： Stamm, Felix I. Naima, Mehdi Schaub, Michael T. RWTH Aachen University Germany Sorbonne Université CNRS LIP6 ParisF-75005 France

In this paper, we extend the classical Color Refinement algorithm for static networks to temporal (undirected and directed) networks. This enables us to design an algorithm to sample synthetic networks that preserves the d-hop neighborhood structure of a given temporal network. The higher d is chosen, the better the temporal neighborhood structure of the original network is preserved. Specifically, we provide efficient algorithms that preserve time-respecting ("causal") paths in the networks up to length d, and scale to real-world network sizes. We validate our approach theoretically (for Degree and Katz centrality) and experimentally (for edge persistence, causal triangles, and burstiness). An experimental comparison shows that our method retains these key temporal characteristics more effectively than existing randomization methods. © 2025, CC BY.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

An Optimally Convergent Split Parallel algorithm for the Multiple-Network Poroelasticity Model

arXiv

引用

arXiv 2025年

作者： Zhao, Jijing Chen, Huangxin Cai, Mingchao Sun, Shuyu School of Mathematical Sciences Tongji University Shanghai China School of Mathematical Sciences Fujian Provincial Key Laboratory on Mathematical Modeling and High Performance Scientific Computing Xiamen University Fujian Xiamen China Department of Mathematics Morgan State University BaltimoreMD21251 United States Shandong Qingdao China

This paper presents a novel split parallel algorithm for solving quasi-static multiple-network poroelasticity (MPET) equations. By introducing a total pressure variable, the MPET system can be reformulated into a coupled Stokes-parabolic system. To efficiently solve this system, we propose a split parallel approach. In the first time step, a monolithic solver is used to solve all variables simultaneously. For subsequent time steps, the system is split into a Stokes subproblem and a parabolic subproblem. These subproblems are then solved in parallel using a stabilization technique. This split parallel approach differs from sequential or iterative decoupling, significantly reducing computational time. The algorithm is proven to be unconditionally stable, optimally convergent, and robust across various parameter settings. These theoretical results are confirmed by numerical experiments. We also apply this parallel algorithm to simulate fluid-tissue interactions within the physiological environment of the human brain. Copyright © 2025, The Authors. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

MULTIDIMENSIONAL MOMENT PROBLEM AND STIELTJES TRANSFORM

arXiv

引用

arXiv 2025年

作者： Kovalyov, Ivan Universität Osnabrück Albrechtstr. 28a Osnabrück49076 Germany

The truncated multidimensional moment problem is studied in terms of the Stieltjes transform as the interpolation problem. A step-by-step algorithm is constructed for the multidimensional moment problem and the set of... 详细信息

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

On counterexamples to the Mertens conjecture

arXiv

引用

arXiv 2025年

作者： Kim, Seungki Nguyen, Phong Q. Department of Mathematical Sciences University of Cincinnati 4199 French Hall West 2815 Commons Way CincinnatiOH45221-0025 United States Department of Computer Science Ecole Normale Supérieure 45 rue d’Ulm Paris75005 France

We use state-of-art lattice algorithms to improve the upper bound on the lowest counterexample to the Mertens conjecture to ≈ exp(1.96 × 1019), which is significantly below the conjectured value of ≈ exp(5.15 &... 详细信息

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Cyclic Relaxed Douglas-Rachford Splitting for Inconsistent Nonconvex Feasibility

arXiv

引用

arXiv 2025年

作者： Dinh, Thi Lan Jansen, G.S. Matthijs Luke, D. Russell Institut für Numerische und Angewandte Mathematik Universität Göttingen Lotzestr. 16–18 Göttingen37083 Germany I. Physical Institute Universität Göttingen Friedrich-Hund-Platz 1 Göttingen37077 Germany Institut für Numerische und Angewandte Mathematik Universität Göttingen Lotzestr. 16–18 Göttingen Germany

We study the cyclic relaxed Douglas-Rachford algorithm for possibly nonconvex, and inconsistent feasibility problems. This algorithm can be viewed as a convex relaxation between the cyclic Douglas-Rachford algorithm first introduced by Borwein and Tam [4] and the classical cyclic projections algorithm. We characterize the fixed points of the cyclic relaxed Douglas-Rachford algorithm and show the relation of the shadows of these fixed points to the fixed points of the cyclic projections algorithm. Finally, we provide conditions that guarantee local quantitative convergence estimates in the nonconvex, inconsistent *** Codes 65K10, 49J53, 49K40, 49M05, 65K05, 90C26, 49M20 © 2025, CC BY.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Impatient Bandits: Optimizing for the Long-Term Without Delay

arXiv

引用

arXiv 2025年

作者： Zhang, Kelly W. Baldwin-McDonald, Thomas Ciosek, Kamil Maystre, Lucas Russo, Daniel Imperial College London United Kingdom University of Manchester United Kingdom Spotify United States UiPath United States Columbia University United States

Increasingly, recommender systems are tasked with improving users’ long-term satisfaction. In this context, we study a content exploration task, which we formalize as a bandit problem with delayed rewards. There is an apparent trade-off in choosing the learning signal: waiting for the full reward to become available might take several weeks, slowing the rate of learning, whereas using short-term proxy rewards reflects the actual long-term goal only imperfectly. First, we develop a predictive model of delayed rewards that incorporates all information obtained to date. Rewards as well as shorter-term surrogate outcomes are combined through a Bayesian filter to obtain a probabilistic belief. Second, we devise a bandit algorithm that quickly learns to identify content aligned with long-term success using this new predictive model. We prove a regret bound for our algorithm that depends on the Value of Progressive Feedback, an information theoretic metric that captures the quality of short-term leading indicators that are observed prior to the long-term reward. We apply our approach to a podcast recommendation problem, where we seek to recommend shows that users engage with repeatedly over two months. We empirically validate that our approach significantly outperforms methods that optimize for short-term proxies or rely solely on delayed rewards, as demonstrated by an A/B test in a recommendation system that serves hundreds of millions of users. Copyright © 2025, The Authors. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：