Zobrazeno 1 - 10
of 944
pro vyhledávání: '"Darbinyan, A."'
Large language models exhibit a remarkable capacity for in-context learning, where they learn to solve tasks given a few examples. Recent work has shown that transformers can be trained to perform simple regression tasks in-context. This work explore
Externí odkaz:
http://arxiv.org/abs/2410.03140
Autor:
Darbinyan, Samvel Kh.
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 26:2, Graph Theory (June 24, 2024) dmtcs:11560
In this paper we prove the following new sufficient condition for a digraph to be Hamiltonian: {\it Let $D$ be a 2-strong digraph of order $n\geq 9$. If $n-1$ vertices of $D$ have degrees at least $n+k$ and the remaining vertex has degree at least $n
Externí odkaz:
http://arxiv.org/abs/2306.16826
Neural networks employ spurious correlations in their predictions, resulting in decreased performance when these correlations do not hold. Recent works suggest fixing pretrained representations and training a classification head that does not use spu
Externí odkaz:
http://arxiv.org/abs/2306.12673
Autor:
Darbinyan, Samvel Kh.
In this note we prove: {\it Let $D$ be a 2-strong digraph of order $n$ such that its $n-1$ vertices have degrees at least $n+k$ and the remaining vertex $z$ has degree at least $n-k-4$, where $k$ is a positive integer. If $D$ contains a cycle of leng
Externí odkaz:
http://arxiv.org/abs/2306.09655
ML-based Approaches for Wireless NLOS Localization: Input Representations and Uncertainty Estimation
The challenging problem of non-line-of-sight (NLOS) localization is critical for many wireless networking applications. The lack of available datasets has made NLOS localization difficult to tackle with ML-driven methods, but recent developments in s
Externí odkaz:
http://arxiv.org/abs/2304.11396
Autor:
Darbinyan, Samvel Kh.
Let $G$ be a strongly connected directed graph of order $p\geq 3$. In this paper, we show that if $d(x)+d(y)\geq 2p-2$ (respectively, $d(x)+d(y)\geq 2p-1$) for every pair of non-adjacent vertices $x, y$, then $G$ contains a Hamiltonian path (with onl
Externí odkaz:
http://arxiv.org/abs/2301.06361
We prove the following new results. (a) Let $T$ be a regular tournament of order $2n+1\geq 11$ and $S$ a subset of $V(T)$. Suppose that $|S|\leq \frac{1}{2}(n-2)$ and $x$, $y$ are distinct vertices in $V(T)\setminus S$. If the subtournament $T-S$ con
Externí odkaz:
http://arxiv.org/abs/2112.08807
Autor:
Samvel Kh. Darbinyan
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 26:2, Iss Graph Theory (2024)
In this paper we prove the following new sufficient condition for a digraph to be Hamiltonian: {\it Let $D$ be a 2-strong digraph of order $n\geq 9$. If $n-1$ vertices of $D$ have degrees at least $n+k$ and the remaining vertex has degree at least
Externí odkaz:
https://doaj.org/article/632e89d9ffa74f6388c3ecda5af4f689
Autor:
Asya Darbinyan
Publikováno v:
Études Arméniennes Contemporaines, Vol 15, Pp 255-260 (2023)
Externí odkaz:
https://doaj.org/article/14f57d8a18504136b729768b73e14b1a
Autor:
Spaulding, Sarah L., Maayah, Marah, Dinauer, Catherine A., Prasad, Manju, Darbinyan, Armine, Morotti, Raffaella, Christison-Lagay, Emily R.
Publikováno v:
In Journal of Pediatric Surgery May 2024 59(5):975-980