Zobrazeno 1 - 10
of 101
pro vyhledávání: '"Ravi Janardan"'
Publikováno v:
Computational Geometry. 82:16-31
We investigate several computational problems related to the stochastic convex hull (SCH). Given a stochastic dataset consisting of n points in \(\mathbb {R}^d\) each of which has an existence probability, a SCH refers to the convex hull of a realiza
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f14f0fbf451ba86b3165dc1fc47f8f3e
https://doi.org/10.1016/j.comgeo.2019.04.002
https://doi.org/10.1016/j.comgeo.2019.04.002
Publikováno v:
Journal of Discrete Algorithms. 44:1-20
Consider a set of n stochastic lines in R 2 , where the existence probability of each line is determined by a fixed probability distribution. For a fixed x-coordinate q, the n lines from top to bottom can be represented by an ordered n-element sequen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff6751ec68282be5b8c9084693f3c4f0
https://doi.org/10.1016/j.jda.2017.04.003
https://doi.org/10.1016/j.jda.2017.04.003
Publikováno v:
VLDB JOURNAL, vol 28, iss 4
The VLDB Journal, vol 28, iss 4
The VLDB Journal, vol 28, iss 4
Hadoop, employing the MapReduce programming paradigm, has been widely accepted as the standard framework for analyzing big data in distributed environments. Unfortunately, this rich framework has not been exploited for processing large-scale computat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9d82f1fc263a445c31dbf519fdbec8e
https://escholarship.org/uc/item/07d1j81x
https://escholarship.org/uc/item/07d1j81x
Publikováno v:
Computational Geometry. 90:101654
The range closest-pair (RCP) problem, as a range-search version of the classical closest-pair problem, aims to store a dataset of points in some data structure such that whenever a query range Q is given, the closest-pair inside Q can be reported eff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f38981c96cb3ab28dc8fa7d2af2fd16
https://doi.org/10.1016/j.comgeo.2020.101654
https://doi.org/10.1016/j.comgeo.2020.101654
Publikováno v:
Computational Geometry. 88:101609
For a set O of n points in R d , the skyline consists of the subset of all points of O where no point is dominated by any other point of O. Suppose that each point o i ∈ O has an associated probability of existence p i ∈ ( 0 , 1 ] . The problem o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4db6436516ed147bf3b685609741e90a
https://doi.org/10.1016/j.comgeo.2020.101609
https://doi.org/10.1016/j.comgeo.2020.101609
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::986ab2109db7ec5b742c3cf60701d6f1
https://doi.org/10.1016/j.jda.2014.10.006
https://doi.org/10.1016/j.jda.2014.10.006
Computer-Aided Design and Manufacturing (CAD/CAM) is concerned with all aspects of the process of designing, prototyping, manufacturing, inspecting, and maintaining complex geometric objects under computer control. As such, there is a natural synergy
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319621265
WADS
WADS
We investigate several computational problems related to the stochastic convex hull (SCH). Given a stochastic dataset consisting of n points in \(\mathbb {R}^d\) each of which has an existence probability, a SCH refers to the convex hull of a realiza
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::316595fd0389b96cc1008146c54826a4
https://doi.org/10.1007/978-3-319-62127-2_49
https://doi.org/10.1007/978-3-319-62127-2_49
Given a dataset $S$ of points in $\mathbb{R}^2$, the range closest-pair (RCP) problem aims to preprocess $S$ into a data structure such that when a query range $X$ is specified, the closest-pair in $S \cap X$ can be reported efficiently. The RCP prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20cd824060f88a4d6ba1bebb4328f92b
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$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1d89439973f1e4e320ab4e81afa6265
https://doi.org/10.1109/tkde.2014.2316807
https://doi.org/10.1109/tkde.2014.2316807