Zobrazeno 1 - 10
of 472
pro vyhledávání: '"Har-Peled, Sariel"'
We show that a minor variant of the continuous Fr\'echet distance between polygonal curves can be computed using essentially the same algorithm used to solve the discrete version, thus dramatically simplifying the algorithm for computing it. The new
Externí odkaz:
http://arxiv.org/abs/2407.03101
Autor:
Har-Peled, Sariel, Lusardi, Maria C.
Let $P$ be a set of $n$ points in $\mathbb{R}^d$, and let $\varepsilon,\psi \in (0,1)$ be parameters. Here, we consider the task of constructing a $(1+\varepsilon)$-spanner for $P$, where every edge might fail (independently) with probability $1-\psi
Externí odkaz:
http://arxiv.org/abs/2407.01466
Autor:
Ashur, Stav, Lusardi, Maria, Markowicz, Marta, Motes, James, Morales, Marco, Har-Peled, Sariel, Amato, Nancy M.
Motion planning in modified environments is a challenging task, as it compounds the innate difficulty of the motion planning problem with a changing environment. This renders some algorithmic methods such as probabilistic roadmaps less viable, as nod
Externí odkaz:
http://arxiv.org/abs/2407.00259
Autor:
Har-Peled, Sariel, Saladi, Rahul
$ \newcommand{\cardin}[1]{\left| {#1} \right|}% \newcommand{\Graph}{\Mh{\mathsf{G}}}% \providecommand{\G}{\Graph}% \renewcommand{\G}{\Graph}% \providecommand{\GA}{\Mh{H}}% \renewcommand{\GA}{\Mh{H}}% \newcommand{\VV}{\Mh{\mathsf{V}}}% \newcommand{\VX
Externí odkaz:
http://arxiv.org/abs/2405.18337
In the classical prophet inequality settings, a gambler is given a sequence of $n$ random variables $X_1, \dots, X_n$, taken from known distributions, observes their values in this (potentially adversarial) order, and select one of them, immediately
Externí odkaz:
http://arxiv.org/abs/2404.11853
Autor:
Ashur, Stav, Har-Peled, Sariel
$ \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\rad}{r} \newcommand{\Mh}[1]{#1} \newcommand{\query}{q} \newcommand{\eps}{\varepsilon} \newcommand{\VorX}[1]{\mathcal{V} \pth{#1}} \newcommand{\
Externí odkaz:
http://arxiv.org/abs/2311.10637
$ \newcommand{\Re}{\mathbb{R}} \newcommand{\BX}{\mathcal{B}} \newcommand{\bb}{\mathsf{b}} \newcommand{\eps}{\varepsilon} \newcommand{\polylog}{\mathrm{polylog}} $ Let $\BX=\{\bb_1, \ldots ,\bb_n\}$ be a set of $n$ axis-aligned boxes in $\Re^d$ where
Externí odkaz:
http://arxiv.org/abs/2311.02050
Autor:
Gao, Zhimeng, Har-Peled, Sariel
$ \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\rad}{r} \newcommand{\Eps}{\Mh{\mathcal{E}}} \newcommand{\p}{\Mh{p}} \newcommand{\q}{\Mh{q}} \newcommand{\Mh}[1]{#1} \newcommand{\query}{q} \new
Externí odkaz:
http://arxiv.org/abs/2310.12792
Autor:
Har-Peled, Sariel
$\newcommand{\eps}{\varepsilon}$ We observe that a $(1-\eps)$-approximation algorithm to Independent Set, that works for any induced subgraph of the input graph, can be used, via a polynomial time reduction, to provide a $(1+\eps)$-approximation to V
Externí odkaz:
http://arxiv.org/abs/2308.00840
Autor:
Har-Peled, Sariel, Raichel, Benjamin
$ \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\optX}[1]{#1^\star} \newcommand{\Qopt}{\Mh{\optX{Q}}} \newcommand{\rad}{r} \newcommand{\Mh}[1]{#1} \newcommand{\query}{q} \newcommand{\eps}{\var
Externí odkaz:
http://arxiv.org/abs/2306.02151