Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Hegeman, James"'
Autor:
Rotem, Nadav, Fix, Jordan, Abdulrasool, Saleem, Catron, Garret, Deng, Summer, Dzhabarov, Roman, Gibson, Nick, Hegeman, James, Lele, Meghan, Levenstein, Roman, Montgomery, Jack, Maher, Bert, Nadathur, Satish, Olesen, Jakob, Park, Jongsoo, Rakhov, Artem, Smelyanskiy, Misha, Wang, Man
This paper presents the design of Glow, a machine learning compiler for heterogeneous hardware. It is a pragmatic approach to compilation that enables the generation of highly optimized code for multiple targets. Glow lowers the traditional neural ne
Externí odkaz:
http://arxiv.org/abs/1805.00907
This paper presents constant-time and near-constant-time distributed algorithms for a variety of problems in the congested clique model. We show how to compute a 3-ruling set in expected $O(\log \log \log n)$ rounds and using this, we obtain a consta
Externí odkaz:
http://arxiv.org/abs/1408.2071
The main results of this paper are (I) a simulation algorithm which, under quite general constraints, transforms algorithms running on the Congested Clique into algorithms running in the MapReduce model, and (II) a distributed $O(\Delta)$-coloring al
Externí odkaz:
http://arxiv.org/abs/1405.4356
Autor:
Hegeman, James, Pemmaraju, Sriram V.
The \textit{facility location} problem consists of a set of \textit{facilities} $\mathcal{F}$, a set of \textit{clients} $\mathcal{C}$, an \textit{opening cost} $f_i$ associated with each facility $x_i$, and a \textit{connection cost} $D(x_i,y_j)$ be
Externí odkaz:
http://arxiv.org/abs/1308.2694
This paper presents a distributed O(1)-approximation algorithm, with expected-$O(\log \log n)$ running time, in the $\mathcal{CONGEST}$ model for the metric facility location problem on a size-$n$ clique network. Though metric facility location has b
Externí odkaz:
http://arxiv.org/abs/1308.2473
Publikováno v:
In Theoretical Computer Science 10 December 2015 608 Part 3:268-281
Autor:
Hegeman, James1 james-hegeman@uiowa.edu, Pemmaraju, Sriram1 sriram-pemmaraju@uiowa.edu
Publikováno v:
Distributed Computing. Oct2015, Vol. 28 Issue 5, p351-374. 24p.
Publikováno v:
Automata, Languages & Programming (9783642315848); 2012, p428-439, 12p
Publikováno v:
Annals of GIS; Oct2014, Vol. 20 Issue 4, p255-264, 10p