Zobrazeno 1 - 10
of 8 824
pro vyhledávání: '"Agarwal, A. K"'
The effectiveness of a query optimizer relies on the accuracy of selectivity estimates. The execution plan generated by the optimizer can be extremely poor in reality due to uncertainty in these estimates. This paper presents PARQO (Penalty-Aware Rob
Externí odkaz:
http://arxiv.org/abs/2406.01526
Publikováno v:
PODS 2024
Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so we are interested in finding durable patterns, such as triangles and paths, which persist over a long
Externí odkaz:
http://arxiv.org/abs/2403.16312
Let $P$ be a set of $m$ points in ${\mathbb R}^2$, let $\Sigma$ be a set of $n$ semi-algebraic sets of constant complexity in ${\mathbb R}^2$, let $(S,+)$ be a semigroup, and let $w: P \rightarrow S$ be a weight function on the points of $P$. We desc
Externí odkaz:
http://arxiv.org/abs/2403.12276
Publikováno v:
ICDT 2024
We are given a set $\mathcal{Z}=\{(R_1,s_1),\ldots, (R_n,s_n)\}$, where each $R_i$ is a \emph{range} in $\Re^d$, such as rectangle or ball, and $s_i \in [0,1]$ denotes its \emph{selectivity}. The goal is to compute a small-size \emph{discrete data di
Externí odkaz:
http://arxiv.org/abs/2401.06047
Given a $d$-dimensional continuous (resp. discrete) probability distribution $\mu$ and a discrete distribution $\nu$, the semi-discrete (resp. discrete) Optimal Transport (OT) problem asks for computing a minimum-cost plan to transport mass from $\mu
Externí odkaz:
http://arxiv.org/abs/2311.02172
$ \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
Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in $d$-space into constant-complexity subcells. In this paper, we settle in the affirmative a few long-standing open problems i
Externí odkaz:
http://arxiv.org/abs/2311.01597
Let $\mathcal{W} \subset \mathbb{R}^2$ be a planar polygonal environment (i.e., a polygon potentially with holes) with a total of $n$ vertices, and let $A,B$ be two robots, each modeled as an axis-aligned unit square, that can translate inside $\math
Externí odkaz:
http://arxiv.org/abs/2310.20615
Publikováno v:
Nanophotonics, Vol 13, Iss 24, Pp 4397-4407 (2024)
Singularity in a two-point complex coherence function, known as coherence vortices, represents zero visibility with a helical phase structure. In this paper, we introduce a novel technique to generate the coherence vortices of different topological c
Externí odkaz:
https://doaj.org/article/e0fb92713f4744f18e17dd84e6adb60e
