Zobrazeno 1 - 10
of 265
pro vyhledávání: '"Furmańczyk, P."'
The goal of positive-unlabeled (PU) learning is to train a binary classifier on the basis of training data containing positive and unlabeled instances, where unlabeled observations can belong either to the positive class or to the negative class. Mod
Externí odkaz:
http://arxiv.org/abs/2404.00145
Autor:
Furmańczyk, Hanna, Mkrtchyan, Vahan
In this paper, we consider some general properties of block graphs as well as the equitable coloring problem in this class of graphs. In the first part we establish the relation between two structural parameters for general block graphs. We also give
Externí odkaz:
http://arxiv.org/abs/2402.05289
Let $G$ be a graph and c a proper k-coloring of G, i.e. any two adjacent vertices u and v have different colors c(u) and c(v). A proper k-coloring is a b-coloring if there exists a vertex in every color class that contains all the colors in its close
Externí odkaz:
http://arxiv.org/abs/2311.13283
Autor:
Furmańczyk, Konrad
We present a nonparametric graphical model. Our model uses an undirected graph that represents conditional independence for general random variables defined by the conditional dependence coefficient (Azadkia and Chatterjee (2021)). The set of edges o
Externí odkaz:
http://arxiv.org/abs/2309.09082
We propose a new graphical model to describe the comorbidity of allergic diseases. We present our model in two versions. First, we introduce a generative model that correctly reflects the variables' causal relationship. Then we propose an approximati
Externí odkaz:
http://arxiv.org/abs/2307.06470
Positive and unlabelled learning is an important problem which arises naturally in many applications. The significant limitation of almost all existing methods lies in assuming that the propensity score function is constant (SCAR assumption), which i
Externí odkaz:
http://arxiv.org/abs/2209.07787
Autor:
Furmańczyk, Hanna, Zuazua, Rita
An adjacent vertex distinguishing total $k$-coloring $f$ of a graph $G$ is a proper total $k$-coloring of $G$ such that no pair of adjacent vertices has the same color sets, where the color set at a vertex $v$, $C^G_f(v)$, is $\{f(v)\} \cup \{f(vu)|u
Externí odkaz:
http://arxiv.org/abs/2208.10884
The problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relatio
Externí odkaz:
http://arxiv.org/abs/2207.05868
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Hanna Furmańczyk, Marek Kubale
Publikováno v:
Archives of Control Sciences, Vol vol. 34, Iss No 1, Pp 211-223 (2024)
A graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest integer k for which such a coloring exists is known as the equ
Externí odkaz:
https://doaj.org/article/11ff78603aa34800a637a171c6fea659
