Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Saladi, Rahul"'
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
Autor:
Saladi Rahul, Yufei Tao
Publikováno v:
ACM Transactions on Algorithms. 18:1-23
A reporting query returns the objects satisfying a predicate q from an input set. In prioritized reporting , each object carries a real-valued weight (which can be query dependent), and a query returns the objects that satisfy q and have weights at l
Autor:
Yakov Nekrich, Saladi Rahul
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3883f605dca0c2ab8f272c9d21fc60a4
https://doi.org/10.1137/1.9781611977554.ch71
https://doi.org/10.1137/1.9781611977554.ch71
Publikováno v:
Algorithmica. 83:1885-1917
Consider a set $$P\subseteq \mathbb {R}^d$$ of n points, and a convex body $$C$$ provided via a separation oracle. The task at hand is to decide for each point of $$P$$ if it is in $$C$$ using the fewest number of oracle queries. We show that one can
Autor:
Saladi Rahul
Publikováno v:
Mathematics of Operations Research. 45:369-383
The orthogonal point enclosure query (OPEQ) problem is a fundamental problem in the context of data management for modeling user preferences. Formally, preprocess a set S of n axis-aligned boxes (possibly overlapping) in ℝd into a data structure so
Autor:
Yufei Tao, Saladi Rahul
Publikováno v:
ACM SIGMOD Record. 48:6-17
Top-k search, which reports the k elements of the highest importance from all the elements in an underlying dataset that satisfy a certain predicate, has attracted significant attention from the database community. The search efficiency crucially dep
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030247652
WADS
WADS
Range closest-pair (RCP) search is a range-search variant of the classical closest-pair problem, which aims to store a given set S of points into some space-efficient data structure such that when a query range Q is specified, the closest pair in \(S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16c9e8ab76dc8e497eb0696121e7c095
https://doi.org/10.1007/978-3-030-24766-9_20
https://doi.org/10.1007/978-3-030-24766-9_20
Publikováno v:
International Journal of Computational Geometry & Applications. 25:245-261
Motivated by a crane assignment problem, we consider a Euclidean bipartite matching problem with edge-crossing constraints. Specifically, given [Formula: see text] red points and [Formula: see text] blue points in the plane, we want to construct a pe
Publikováno v:
Journal of Discrete Algorithms. 30:1-12
Range search is a fundamental query-retrieval problem, where the goal is to preprocess a given set of points so that the points lying inside a query object (e.g., a rectangle, or a ball, or a halfspace) can be reported efficiently. This paper conside
Autor:
Saladi Rahul, Ravi Janardan
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 26:2859-2871
In a top- $k$ Geometric Intersection Query (top- $k$ GIQ) problem, a set of $n$ weighted, geometric objects in ${\bb R}^d$ is to be pre-processed into a compact data structure so that for any query geometric object, $q$ , and integer $k>0$ , the $k$