Zobrazeno 1 - 4
of 4
pro vyhledávání: '"GOPALAN, ARJUN"'
Autor:
Lu, Chun-Ta, Zeng, Yun, Juan, Da-Cheng, Fan, Yicheng, Li, Zhe, Dlabal, Jan, Chen, Yi-Ting, Gopalan, Arjun, Heydon, Allan, Ferng, Chun-Sung, Miyara, Reah, Fuxman, Ariel, Peng, Futang, Li, Zhen, Duerig, Tom, Tomkins, Andrew
In this work, we propose CARLS, a novel framework for augmenting the capacity of existing deep learning frameworks by enabling multiple components -- model trainers, knowledge makers and knowledge banks -- to concertedly work together in an asynchron
Externí odkaz:
http://arxiv.org/abs/2105.12849
Recent studies have indicated that Graph Convolutional Networks (GCNs) act as a \emph{low pass} filter in spectral domain and encode smoothed node representations. In this paper, we consider their opposite, namely Graph Deconvolutional Networks (GDNs
Externí odkaz:
http://arxiv.org/abs/2012.11898
Autor:
OUSTERHOUT, JOHN1, GOPALAN, ARJUN1, GUPTA, ASHISH1, KEJRIWAL, ANKITA1, LEE, COLLIN1, MONTAZERI, BEHNAM1, ONGARO, DIEGO1, SEO JIN PARK1, QIN, HENRY1, ROSENBLUM, MENDEL1, RUMBLE, STEPHEN1, STUTSMAN, RYAN1, YANG, STEPHEN1
Publikováno v:
ACM Transactions on Computer Systems. Aug2015, Vol. 33 Issue 3, p7:1-7:55. 55p.
We exhibit the following new upper bounds on the space complexity and the parallel complexity of the Bipartite Perfect Matching (BPM) problem for graphs of small genus: (1) BPM in planar graphs is in UL (improves upon the SPL bound from Datta, Kulkar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b7761269e7bbf3f49ba1ff0d6c73b42