Zobrazeno 1 - 10
of 705
pro vyhledávání: '"Taylor, Erin A."'
In this paper, we propose to use the concept of local fairness for auditing and ranking redistricting plans. Given a redistricting plan, a deviating group is a population-balanced contiguous region in which a majority of individuals are of the same i
Externí odkaz:
http://arxiv.org/abs/2210.11643
Publikováno v:
Computational Geometry, 102019 (2023)
We study the problem of motion planning for a collection of $n$ labeled unit disc robots in a polygonal environment. We assume that the robots have revolving areas around their start and final positions: that each start and each final is contained in
Externí odkaz:
http://arxiv.org/abs/2210.00123
Autor:
Broløs, Anette1 anette@finthropology.com, Taylor, Erin B.2 erin@finthropology.com
Publikováno v:
Proceedings of ISPIM Conferences. 2024, p1-7. 7p.
Autor:
Griffin, Joan M., Mandrekar, Jay N., Vanderboom, Catherine E., Harmsen, William S., Kaufman, Brystana G., Wild, Ellen M., Dose, Ann Marie, Ingram, Cory J., Taylor, Erin E., Stiles, Carole J., Gustavson, Allison M., Holland, Diane E.
Publikováno v:
In Journal of Pain and Symptom Management November 2024 68(5):456-466
We model the societal task of redistricting political districts as a partitioning problem: Given a set of $n$ points in the plane, each belonging to one of two parties, and a parameter $k$, our goal is to compute a partition $\Pi$ of the plane into r
Externí odkaz:
http://arxiv.org/abs/2112.06899
Autor:
Smith, Allie M.1 (AUTHOR) asmith40@umc.edu, Taylor, Erin B.2 (AUTHOR) ertaylor@umc.edu, Brooks, Ruth J.1 (AUTHOR) rbrooks1@umc.edu, Dos Santos e Santos, Christiano1 (AUTHOR) cdsantos@mdanderson.org, Grayson, Bernadette E.1,3 (AUTHOR) bgrayson@umc.edu
Publikováno v:
Brain Sciences (2076-3425). Apr2024, Vol. 14 Issue 4, p398. 13p.
We consider the problem of center-based clustering in low-dimensional Euclidean spaces under the perturbation stability assumption. An instance is $\alpha$-stable if the underlying optimal clustering continues to remain optimal even when all pairwise
Externí odkaz:
http://arxiv.org/abs/2009.14358
Autor:
Nath, Abhinandan, Taylor, Erin
We give the first near-linear time $(1+\eps)$-approximation algorithm for $k$-median clustering of polygonal trajectories under the discrete Fr\'{e}chet distance, and the first polynomial time $(1+\eps)$-approximation algorithm for $k$-median cluster
Externí odkaz:
http://arxiv.org/abs/2004.00722
Publikováno v:
In Child Abuse & Neglect December 2023 146
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.