找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Synergies in Analysis, Discrete Mathematics, Soft Computing and Modelling; P. V. Subrahmanyam,V. Antony Vijesh,Prakash Veerar Book 2023 Th

[复制链接]
楼主: hearken
发表于 2025-3-26 22:17:38 | 显示全部楼层
Note on Distributivity of Different String Operations Over Language Sets, Strings over an alphabet can be subjected to more operations like reverse-duplication, pseudo-duplication, etc. In this paper, we study the nature of the distribution of duplication, reverse-duplication and pseudo-duplication operations over the set operations like union, intersection and complemen
发表于 2025-3-27 04:36:30 | 显示全部楼层
发表于 2025-3-27 08:57:04 | 显示全部楼层
,A Short Proof of Ore’s ,-Factor Theorem Using Flows,em. In this paper, we prove Ore’s theorem using flows in networks and our proof is simpler. A polynomial time (linear) algorithm . is derived to find an .-factor if it exists or else a . is found to prove the non-existence of an .-factor. The deficiency version of Ore’s theorem is given.
发表于 2025-3-27 09:57:28 | 显示全部楼层
发表于 2025-3-27 14:38:51 | 显示全部楼层
Role of Single Valued Linear Octagonal Neutrosophic Numbers in Multi-attribute Decision-Making Prob Single Valued Linear Octagonal Neutrosophic Numbers (SVLONNs) is introduced. Cut sets for truth membership, indeterminacy membership, and falsity membership degrees are defined and using the same arithmetic operations such as addition and scalar multiplication on the collection of SVLONNs are inves
发表于 2025-3-27 19:43:06 | 显示全部楼层
发表于 2025-3-28 01:35:54 | 显示全部楼层
发表于 2025-3-28 05:02:03 | 显示全部楼层
Experimental Evaluation of Four Intermediate Filters to Improve the Motion Field Estimation,placements and illumination changes, we tested it with four different filters: Bilateral filter (BF), Median filter (MF), Weighted median filter (WMF), and a new filter called a Balanced median filter (BMF). This BMF is a weighted sum of the Median filter and the Bilateral filter (BF) using an adapt
发表于 2025-3-28 08:25:16 | 显示全部楼层
,Herscovici’s Conjecture on Product of Some Complete Bipartite Graphs, to any target vertex, whenever the following inequality . holds. For any connected graph, . is the first pebbling conjecture which is proposed by Chung, called as Graham’s Conjecture. For finding the bounds of the .-pebbling number for the product of graphs, Lourdusamy extended this conjecture as .
发表于 2025-3-28 14:12:23 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-18 18:00
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表