Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Csikos, Monika"'
Publikováno v:
Symposium on Experimental Algorithms (SEA) 2024, Jul 2024, Vienne, Austria
For any set system $H=(V,R), \ R \subseteq 2^V$, a subset $S \subseteq V$ is called \emph{shattered} if every $S' \subseteq S$ results from the intersection of $S$ with some set in $\R$. The \emph{VC-dimension} of $H$ is the size of a largest shatter
Externí odkaz:
http://arxiv.org/abs/2405.07588
In this paper, we study temporal graphs arising from mobility models, where vertices correspond to agents moving in space and edges appear each time two agents meet. We propose a rather natural one-dimensional model. If each pair of agents meets exac
Externí odkaz:
http://arxiv.org/abs/2302.07666
Autor:
Csikós, Mónika, Mustafa, Nabil H.
We study one of the key tools in data approximation and optimization: low-discrepancy colorings. Formally, given a finite set system $(X,\mathcal S)$, the \emph{discrepancy} of a two-coloring $\chi:X\to\{-1,1\}$ is defined as $\max_{S \in \mathcal S}
Externí odkaz:
http://arxiv.org/abs/2209.01147
Given a triangle $\Delta$, we study the problem of determining the smallest enclosing and largest embedded isosceles triangles of $\Delta$ with respect to area and perimeter. This problem was initially posed by Nandakumar and was first studied by Kis
Externí odkaz:
http://arxiv.org/abs/2205.11637
Autor:
Csikós, Mónika, Mustafa, Nabil H.
Publikováno v:
Published in Information Processing Letters, Volume 176, June 2022, 106250
The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of this paper
Externí odkaz:
http://arxiv.org/abs/2008.08970
The VC-dimension of a set system is a way to capture its complexity and has been a key parameter studied extensively in machine learning and geometry communities. In this paper, we resolve two longstanding open problems on bounding the VC-dimension o
Externí odkaz:
http://arxiv.org/abs/1807.07924
Autor:
Axenovich, Maria, Csikós, Mónika
Publikováno v:
Discrete Mathematics, Volume 342, Issue 4, April 2019, Pages 1195-1212
A graph $G$ is $H$-saturated for a graph $H$, if $G$ does not contain a copy of $H$ but adding any new edge to $G$ results in such a copy. An $H$-saturated graph on a given number of vertices always exists and the properties of such graphs, for examp
Externí odkaz:
http://arxiv.org/abs/1803.06244
Autor:
Axenovich, Maria, Csikós, Mónika
Publikováno v:
In Discrete Mathematics April 2019 342(4):1195-1212
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:
Csikós, Mónika, Mustafa, Nabil H.
Publikováno v:
In Information Processing Letters June 2022 176