Zobrazeno 1 - 10
of 144
pro vyhledávání: '"Zinn, Daniel"'
Autor:
Zinn, Daniel.
Thesis (Ph. D.)--University of California, Davis, 2010.
Title based on PDF title page (viewed 07/22/2010). Degree granted in Computer Science.
Title based on PDF title page (viewed 07/22/2010). Degree granted in Computer Science.
Externí odkaz:
http://proquest.umi.com/pqdweb?did=2065739161&sid=1&Fmt=2&clientId=48051&RQT=309&VName=PQD
Autor:
Lin, Howard, Scull, Brooks P., Goldberg, Baruch R., Abhyankar, Harshal A., Eckstein, Olive E., Zinn, Daniel J., Lubega, Joseph, Agrusa, Jennifer, El Mallawaney, Nader, Gulati, Nitya, Forbes, Lisa, Chinn, Ivan, Chakraborty, Rikhia, Velasquez, Jessica, Goldman, Jordana, Bashir, Dalia, Lam, Fong, Muscal, Eyal, Henry, Michael. M., Greenberg, Jay N., Ladisch, Stephan, Hermiston, Michelle L., Meyer, Lauren K., Jeng, Michael, Naqvi, Ahmed, McClain, Kenneth, Nguyen, Trung, Wong, Hector, Man, Tsz-Kwong, Jordan, Michael B. *, Allen, Carl E. *, *
Publikováno v:
In Blood Advances 14 September 2021 5(17):3457-3467
Autor:
Zinn, Daniel
We investigate applying general-purpose join algorithms to the triangle listing problem in an out-of-core context. In particular, we focus on Leapfrog Triejoin (LFTJ) by Veldhuizen 2014, a recently proposed, worst-case optimal algorithm. We present "
Externí odkaz:
http://arxiv.org/abs/1501.06689
Autor:
Lim, Karen Phaik Har, Milne, Paul, Poidinger, Michael, Duan, Kaibo, Lin, Howard, McGovern, Naomi, Abhyankar, Harshal, Zinn, Daniel, Burke, Thomas M., Eckstein, Olive S., Chakraborty, Rikhia, Sengal, Amel, Scull, Brooks, Newell, Evan, Merad, Miriam, McClain, Kenneth L., Man, Tsz-Kwong, Ginhoux, Florent, Collin, Matthew, Allen, Carl E.
Publikováno v:
In Blood Advances 14 January 2020 4(1):87-99
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog${}^\neg$ program and the number of "coordination stages" required for its distributed computation. Indeed, Ameloot et al. [9] showed
Externí odkaz:
http://arxiv.org/abs/1312.2919
Publikováno v:
Peter Buneman Festschrift, LNCS 8000, 2013
We propose a new model of provenance, based on a game-theoretic approach to query evaluation. First, we study games G in their own right, and ask how to explain that a position x in G is won, lost, or drawn. The resulting notion of game provenance is
Externí odkaz:
http://arxiv.org/abs/1309.2655
Autor:
Zinn, Daniel
Our earlier work titled: "Win-move is Coordination-Free (Sometimes)" has shown that the classes of queries that can be distributedly computed in a coordination-free manner form a strict hierarchy depending on the assumptions of the model for distribu
Externí odkaz:
http://arxiv.org/abs/1202.0242
Autor:
Lucchini, Giovanna, Marsh, Rebecca, Gilmour, Kimberly, Worth, Austen, Nademi, Zohreh, Rao, Anupama, Booth, Claire, Amrolia, Persis, Silva, Juliana, Chiesa, Robert, Wynn, Robert, Lehmberg, Kai, Astigarraga, Itziar, Güngör, Tayfun, Stary, Jan, Moshous, Despina, Ifversen, Marianne, Zinn, Daniel, Jordan, Michael, Kumar, Ashish, Yasumi, Takahiro, Veys, Paul, Rao, Kanchan *
Publikováno v:
In Blood 8 November 2018 132(19):2088-2096
Publikováno v:
In Future Generation Computer Systems 2009 25(5):541-551
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.