Zobrazeno 1 - 10
of 6 464
pro vyhledávání: '"Sheikholeslami A"'
Autor:
Atapour, S. Kawa, SeyedMohammadi, S. Jamal, Sheikholeslami, S. Mohammad, Abouei, Jamshid, Plataniotis, Konstantinos N., Mohammadi, Arash
Recently pre-trained Foundation Models (FMs) have been combined with Federated Learning (FL) to improve training of downstream tasks while preserving privacy. However, deploying FMs over edge networks with resource-constrained Internet of Things (IoT
Externí odkaz:
http://arxiv.org/abs/2409.09273
The growing demand for high-resolution maps across various applications has underscored the necessity of accurately segmenting building vectors from overhead imagery. However, current deep neural networks often produce raster data outputs, leading to
Externí odkaz:
http://arxiv.org/abs/2407.12256
Publikováno v:
Discussiones Mathematicae Graph Theory 42 (2022) 937-958
A Roman $\{2\}$-dominating function (R2F) is a function $f:V\rightarrow \{0,1,2\}$ with the property that for every vertex $v\in V$ with $f(v)=0$ there is a neighbor $u$ of $v$ with $f(u)=2$, or there are two neighbors $x,y$ of $v$ with $f(x)=f(y)=1$
Externí odkaz:
http://arxiv.org/abs/2402.07968
Publikováno v:
Mediterranean Journal of Mathematics (2023) 20:171
Let $\{0,1,\dots, t\}$ be abbreviated by $[t].$ A double Roman dominating function (DRDF) on a graph $\Gamma=(V,E)$ is a map $l:V\rightarrow [3]$ satisfying \textrm{(i)} if $l(r)=0$ then there must be at least two neighbors labeled 2 under $l$ or a n
Externí odkaz:
http://arxiv.org/abs/2402.07020
Publikováno v:
Applied Mathematics and Computation 414 (2022) 126662
A maximal double Roman dominating function (MDRDF) on a graph $G=(V,E)$ is a function $f:V(G)\rightarrow \{0,1,2,3\}$ such that \textrm{(i) }every vertex $v$ with $f(v)=0$ is adjacent to least two vertices { assigned $2$ or to at least one vertex ass
Externí odkaz:
http://arxiv.org/abs/2402.07013
Autor:
Ahangar, Hossein Abdollahzadeh, Alvarez, M. Pilar, Chellali, Mustapha, Sheikholeslami, Seyed Mahmoud, Valenzuela-Tripodoro, Juan Carlos
Publikováno v:
applied math and computation, 391 (2021)
The Roman domination in graphs is well-studied in graph theory. The topic is related to a defensive strategy problem in which the Roman legions are settled in some secure cities of the Roman Empire. The deployment of the legions around the Empire is
Externí odkaz:
http://arxiv.org/abs/2402.07009
In many real-world problems, there is a limited set of training data, but an abundance of unlabeled data. We propose a new method, Generative Posterior Networks (GPNs), that uses unlabeled data to estimate epistemic uncertainty in high-dimensional pr
Externí odkaz:
http://arxiv.org/abs/2312.17411
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Pp 1-12 (2024)
An outer-independent triple Roman dominating function (OI[3]RDF) on a graph [Formula: see text] is function [Formula: see text] having the property that (i) if [Formula: see text] then v must have either a neighbor assigned 4 or two neighbors one of
Externí odkaz:
https://doaj.org/article/dd8dfc2031a14f5a8db6e3381cdafa32
In order to fully benefit from cloud computing, services are designed following the "multi-tenant" architectural model, which is aimed at maximizing resource sharing among users. However, multi-tenancy introduces challenges of security, performance i
Externí odkaz:
http://arxiv.org/abs/2307.09132
Large-scale conversational systems typically rely on a skill-routing component to route a user request to an appropriate skill and interpretation to serve the request. In such system, the agent is responsible for serving thousands of skills and inter
Externí odkaz:
http://arxiv.org/abs/2306.04823