Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Esther M Arkin"'
Autor:
Valentin Polishchuk, Esther M Arkin, Alon Efrat, Christian Knauer, Joseph SB Mitchell, Günter Rote, Lena Schlipf, Topi Talvitie
Publikováno v:
Journal of Computational Geometry, Vol 7, Iss 2 (2016)
We show how to preprocess a polygonal domain with a fixed starting point $s$ in order to answer efficiently the following queries: Given a point $q$, how should one move from $s$ in order to see $q$ as soon as possible? This query resembles the well-
Externí odkaz:
https://doaj.org/article/6cabca0373824e5fa0efdfd870399d35
Publikováno v:
Discrete Applied Mathematics. 254:10-16
We study a facility location problem motivated by requirements pertaining to the distribution of charging stations for electric vehicles: Place a minimum number of battery charging stations at a subset of nodes of a network, so that battery-powered e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c592d314935b8e02be441e65f3931544
https://doi.org/10.1016/j.dam.2018.07.019
https://doi.org/10.1016/j.dam.2018.07.019
Autor:
Aritra Banik, Marina Simakov, Gui Citovsky, Joseph S. B. Mitchell, Esther M. Arkin, Paz Carmi, Matthew J. Katz
Publikováno v:
Discrete Applied Mathematics. 250:75-86
Let U be a set of colored objects, where the color of an object is an integer between 1 and n . Let P = { C 1 , … , C n } be the partition of U into color classes, i.e., the set C i consists of all objects in U colored i . We study two families of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d0e28ce952b68d848a9b3c9742caa60
https://doi.org/10.1016/j.dam.2018.05.011
https://doi.org/10.1016/j.dam.2018.05.011
Autor:
Jie Gao, Alon Efrat, Yanjun Pan, Hanyu Quan, Ming Li, Joseph S. B. Mitchell, Boyang Wang, Esther M. Arkin
Publikováno v:
MobiHoc
Due to increasing concerns of data privacy, databases are being encrypted before they are stored on an untrusted server. To enable search operations on the encrypted data, searchable encryption techniques have been proposed. Representative schemes us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::caad1a3892a7fa48fcbd5ac82c7940c5
https://doi.org/10.1145/3397166.3409135
https://doi.org/10.1145/3397166.3409135
Autor:
Alon Efrat, Yair Allouche, Michael Segal, Esther M. Arkin, Swaminathan Sankararaman, Guy Grebla, Yuval Cassuto, Joseph S. B. Mitchell
Publikováno v:
MobiHoc
Security-sensitive applications, such as patient health monitoring and credit card transactions, are increasingly utilizing wireless communication systems, RFIDs, wireless sensor networks, and other wireless communication systems. The use of interfer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::226d8562032232b374d45f5054aff656
https://doi.org/10.1016/j.pmcj.2017.07.011
https://doi.org/10.1016/j.pmcj.2017.07.011
Autor:
Erik D. Demaine, Vida Dujmović, Robin Flatland, André van Renssen, Mirela Damian, Belén Palop, Irene Parada, Hugo A. Akitaya, Matias Korman, Vera Sacristán, Esther M. Arkin
We present the first universal reconfiguration algorithm for transforming a modular robot between any two facet-connected square-grid configurations using pivot moves. More precisely, we show that five extra “helper” modules (“musketeers”) su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5cf6f69bae0d0762e4c65a3137547a35
Autor:
Ferran Hurtado, Rodrigo I. Silveira, Piyush Kumar, Esther M. Arkin, Joseph S. B. Mitchell, Maria Saumell, Belén Palop, José Miguel Díaz-Báñez, Pablo Pérez-Lantero
Publikováno v:
Computational Geometry. 48:94-107
We study a class of geometric optimization problems closely related to the 2-center problem: Given a set S of n pairs of points in the plane, for every pair, we want to assign red color to a point of the pair and blue color to the other point in orde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9d977c6b39c29f2183a62ba096c1c1f
https://doi.org/10.1016/j.comgeo.2014.08.004
https://doi.org/10.1016/j.comgeo.2014.08.004
Autor:
Esther M. Arkin, Jiemin Zeng, Rik Sarkar, Jie Gao, Matthew P. Johnson, Joseph S. B. Mitchell, Gaurish Telang
Publikováno v:
MobiHoc
Zeng, J, Telang, G, Johnson, M P, Sarkar, R, Gao, J, Arkin, E M & Mitchell, J S B 2017, Mobile r-gather: Distributed and Geographic Clustering for Location Anonymity . in Mobihoc '17 Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing . 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Chennai, India, 10/07/17 . https://doi.org/10.1145/3084041.3084056
Zeng, J, Telang, G, Johnson, M P, Sarkar, R, Gao, J, Arkin, E M & Mitchell, J S B 2017, Mobile r-gather: Distributed and Geographic Clustering for Location Anonymity . in Mobihoc '17 Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing . 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Chennai, India, 10/07/17 . https://doi.org/10.1145/3084041.3084056
We study the r -gather clustering problem in a mobile and distributed seŠing. In this problem, nodes must be clustered into groups of at least r nodes each, and the goal is to minimize the diameter of the clusters. This notion of clustering is motiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae874ac2cca518f7e7dfffe464868a9d
https://doi.org/10.1145/3084041.3084056
https://doi.org/10.1145/3084041.3084056
Publikováno v:
Approximation and Online Algorithms ISBN: 9783319517407
WAOA
WAOA
Given a set of pairs of points in the plane, the goal of the shortest separating cycle problem is to find a simple tour of minimum length that separates the two points of each pair to different sides. In this article we prove hardness of the problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62765b1e13183a3d582c2a3d3f264a86
https://doi.org/10.1007/978-3-319-51741-4_1
https://doi.org/10.1007/978-3-319-51741-4_1
Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks
Autor:
Alon Efrat, Javad Taheri, Valentin Polishchuk, Joseph S. B. Mitchell, Swaminathan Sankararaman, Esther M. Arkin, Srinivasan Ramasubramanian
Publikováno v:
Ad Hoc Networks. 12:201-218
In this paper, we study the fundamental optimization problem in wireless sensor networks of base-station positioning such that data from the sensors may be transmitted to it in an energy-efficient manner. We primarily consider the setting where a sen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae5f346b42056ff944547120d1ab0ede
https://doi.org/10.1016/j.adhoc.2011.09.010
https://doi.org/10.1016/j.adhoc.2011.09.010