Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Vahideh Keikha"'
Publikováno v:
International Journal of Data Science and Analytics. 15:201-216
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d4fc5f642a5c27cfb2074982ff232d6
https://doi.org/10.1007/s41060-021-00301-0
https://doi.org/10.1007/s41060-021-00301-0
Autor:
Vahideh Keikha, Maria Saumell
Given an $n$-vertex 1.5D terrain $\T$ and a set $\A$ of $m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09f1a56524528f22d1aeb117334c6460
http://arxiv.org/abs/2301.05049
http://arxiv.org/abs/2301.05049
Publikováno v:
The Journal of Supercomputing. 77:936-972
Given a set of n segments and a query shape Q, the windowing length query asks for finding the sum of the lengths of the parts of the segments that lie inside Q. The popular places problem of a set of curves asks for the subset of the plane where eac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46f5caacde3730a136a9a1f5693d122b
https://doi.org/10.1007/s11227-020-03299-7
https://doi.org/10.1007/s11227-020-03299-7
Publikováno v:
Theoretical Computer Science. 814:259-270
Given a set D = { d 1 , … , d n } of imprecise points modeled as disks, the minimum diameter problem is to locate a set P = { p 1 , … , p n } of fixed points, where p i ∈ d i , such that the furthest distance between any pair of points in P is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6769e68dbde498bbacc042b16cefd3ee
https://doi.org/10.1016/j.tcs.2020.02.006
https://doi.org/10.1016/j.tcs.2020.02.006
Autor:
Vahideh Keikha
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031221040
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db1a7df876bb52f853e860b1e6427396
https://doi.org/10.1007/978-3-031-22105-7_5
https://doi.org/10.1007/978-3-031-22105-7_5
Publikováno v:
Theoretical Computer Science
Let $\cal R$ be a set of $n$ colored imprecise points, where each point is colored by one of $k$ colors. Each imprecise point is specified by a unit disk in which the point lies. We study the problem of computing the smallest and the largest possible
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f60552558e4bd07a6fd9e2645222f1f
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030678982
CALDAM
CALDAM
In this paper, we introduce the outlier detection problem in a set of uncertain points. We study two variants of the problems based upon the definition of the outlier. For a given positive integer \(k(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3685237cdd168ce9ca61fed41cebee6b
https://doi.org/10.1007/978-3-030-67899-9_13
https://doi.org/10.1007/978-3-030-67899-9_13
Publikováno v:
Combinatorial Optimization and Applications ISBN: 9783030926809
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3353d6e57fceec3fd2835c72455b8d2f
https://doi.org/10.1007/978-3-030-92681-6_46
https://doi.org/10.1007/978-3-030-92681-6_46
Publikováno v:
International Computing and Combinatorics Conference COCOON 2021
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Computing and Combinatorics
Lecture Notes in Computer Science ISBN: 9783030895426
COCOON
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Computing and Combinatorics
Lecture Notes in Computer Science ISBN: 9783030895426
COCOON
Let \(\mathcal R\) be a set of n colored imprecise points, where each point is colored by one of k colors. Each imprecise point is specified by a unit disk in which the point lies. We study the problem of computing the smallest and the largest possib
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d9b3e913bf761fdd4949215df6f8eed
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030895426
COCOON
COCOON
We study a constrained version of the Geometric Hitting Set problem where we are given a set of points, partitioned into disjoint subsets, and a set of intervals. The objective is to hit all the intervals with a minimum number of points such that if
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af40103be35f62ba2c8e6875f98ac469
https://doi.org/10.1007/978-3-030-89543-3_50
https://doi.org/10.1007/978-3-030-89543-3_50