Zobrazeno 1 - 10
of 488
pro vyhledávání: '"Goodrich, Michael T."'
Ateniese, Goodrich, Lekakis, Papamanthou, Paraskevas, and Tamassia introduced the Accountable Storage protocol, which is a way for a client to outsource their data to a cloud storage provider while allowing the client to periodically perform accounta
Externí odkaz:
http://arxiv.org/abs/2411.00255
We study algorithms for drawing planar graphs and 1-planar graphs using cubic B\'ezier curves with bounded curvature. We show that any n-vertex 1-planar graph has a 1-planar RAC drawing using a single cubic B\'ezier curve per edge, and this drawing c
Externí odkaz:
http://arxiv.org/abs/2410.12083
Autor:
Goodrich, Michael T., Kitagawa, Ryuto
In this paper, we present Ray-shooting Quickhull, which is a simple, randomized, outputsensitive version of the Quickhull algorithm for constructing the convex hull of a set of n points in the plane. We show that the randomized Ray-shooting Quickhull
Externí odkaz:
http://arxiv.org/abs/2409.19784
In the 1960s, the world-renowned social psychologist Stanley Milgram conducted experiments that showed that not only do there exist ``short chains'' of acquaintances between any two arbitrary people, but that these arbitrary strangers are able to fin
Externí odkaz:
http://arxiv.org/abs/2403.08105
Publikováno v:
Proceedings on Privacy Enhancing Technologies (PoPETs), Vol. 2023, No. 3, pp. 432-445, 2023
Motivated by the importance of floating-point computations, we study the problem of securely and accurately summing many floating-point numbers. Prior work has focused on security absent accuracy or accuracy absent security, whereas our approach achi
Externí odkaz:
http://arxiv.org/abs/2312.10247
Autor:
Chiu, Alvin, Ghosh, Mithun, Ahmed, Reyan, Jun, Kwang-Sung, Kobourov, Stephen, Goodrich, Michael T.
Graph neural networks have been successful for machine learning, as well as for combinatorial and graph problems such as the Subgraph Isomorphism Problem and the Traveling Salesman Problem. We describe an approach for computing graph sparsifiers by c
Externí odkaz:
http://arxiv.org/abs/2311.10316
We study methods to manipulate weights in stress-graph embeddings to improve convex straight-line planar drawings of 3-connected planar graphs. Stress-graph embeddings are weighted versions of Tutte embeddings, where solving a linear system places ve
Externí odkaz:
http://arxiv.org/abs/2307.10527
Using the framework of Tutte embeddings, we begin an exploration of \emph{quantum graph drawing}, which uses quantum computers to visualize graphs. The main contributions of this paper include formulating a model for quantum graph drawing, describing
Externí odkaz:
http://arxiv.org/abs/2307.08851
We define simple variants of zip trees, called zip-zip trees, which provide several advantages over zip trees, including overcoming a bias that favors smaller keys over larger ones. We analyze zip-zip trees theoretically and empirically, showing, e.g
Externí odkaz:
http://arxiv.org/abs/2307.07660