Zobrazeno 1 - 10
of 131
pro vyhledávání: '"Hirschberg, Daniel"'
Autor:
Eppstein, David, Hirschberg, Daniel S.
Publikováno v:
Algorithmica 80 (4): 1278-1297, 2018
We show how to select an item with the majority color from $n$ two-colored items, given access to the items only through an oracle that returns the discrepancy of subsets of $k$ items. We use $n/\lfloor\tfrac{k}{2}\rfloor+O(k)$ queries, improving a p
Externí odkaz:
http://arxiv.org/abs/1512.06488
Autor:
Hirschberg, Daniel
Publikováno v:
Abstract.
Diss. (sammanfattning) Stockholm : Karol. inst., 2004.
Härtill 7 uppsatser.
Härtill 7 uppsatser.
Externí odkaz:
http://diss.kib.ki.se/2004/91-7349-934-x/
We formalize a problem we call combinatorial pair testing (CPT), which has applications to the identification of uncooperative or unproductive participants in pair programming, massively distributed computing, and crowdsourcing environments. We give
Externí odkaz:
http://arxiv.org/abs/1305.0110
A dictionary (or map) is a key-value store that requires all keys be unique, and a multimap is a key-value store that allows for multiple values to be associated with the same key. We design hashing-based indexing schemes for dictionaries and multima
Externí odkaz:
http://arxiv.org/abs/1107.4378
Publikováno v:
Journal of Combinatorial Optimization, Volume 15, Number 1, January, 2008
We study group-testing algorithms for resolving broadcast conflicts on a multiple access channel (MAC) and for identifying the dead sensors in a mobile ad hoc wireless network. In group-testing algorithms, we are asked to identify all the defective i
Externí odkaz:
http://arxiv.org/abs/0905.1906
Publikováno v:
INTEGERS: Electronic Journal of Combinatorial Number Theory 7 (2007) #G07
The solitaire army is a one-person peg jumping game where a player attempts to advance an "army" of pegs as far as possible into empty territory. The game was introduced by John Conway and is also known as "Conway's Soldiers". We consider various gen
Externí odkaz:
http://arxiv.org/abs/math/0612612
Publikováno v:
SIAM J. Computing 36(5):1360-1375, 2007
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which identify the at most d items out of a given set of n items that are defec
Externí odkaz:
http://arxiv.org/abs/cs/0505048
Publikováno v:
J. Graph Algorithms & Applications 4(3):5-17, 2000
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straight-line edges and assign each edge to a layer so that no two edges on the same layer cross. The geometric thickne
Externí odkaz:
http://arxiv.org/abs/math/9910185
Autor:
Hirschberg, Daniel1 (AUTHOR), Ekman, Bertil2 (AUTHOR), Wahlberg, Jeanette2 (AUTHOR), Landberg, Eva3 (AUTHOR) eva.landberg@regionostergotland.se
Publikováno v:
PLoS ONE. 2/26/2021, Vol. 16 Issue 2, p1-12. 12p.
Publikováno v:
Proceedings of the National Academy of Sciences of the United States of America, 2009 Aug . 106(34), 14327-14332.
Externí odkaz:
https://www.jstor.org/stable/40484420