Seuraa
Yuichi Yoshida
Yuichi Yoshida
National Institute of Informatics
Vahvistettu sähköpostiosoite verkkotunnuksessa nii.ac.jp - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Spectral normalization for generative adversarial networks
T Miyato, T Kataoka, M Koyama, Y Yoshida
arXiv preprint arXiv:1802.05957, 2018
56112018
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
T Akiba, Y Iwata, Y Yoshida
Proceedings of the 2013 ACM SIGMOD International Conference on Management of …, 2013
4952013
Spectral norm regularization for improving the generalizability of deep learning
Y Yoshida, T Miyato
arXiv preprint arXiv:1705.10941, 2017
3922017
Fast and accurate influence maximization on large networks with pruned monte-carlo simulations
N Ohsaka, T Akiba, Y Yoshida, K Kawarabayashi
Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014
2272014
Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling
T Akiba, Y Iwata, Y Yoshida
Proceedings of the 23rd international conference on World wide web, 237-248, 2014
1292014
Maximizing monotone submodular functions over the integer lattice
T Soma, Y Yoshida
Mathematical Programming 172 (1-2), 539-563, 2018
1072018
A generalization of submodular cover via the diminishing return property on the integer lattice
T Soma, Y Yoshida
Advances in neural information processing systems 28, 2015
1062015
Dynamic influence analysis in evolving networks
N Ohsaka, T Akiba, Y Yoshida, K Kawarabayashi
Proceedings of the VLDB Endowment 9 (12), 1077-1088, 2016
1032016
An improved constant-time approximation algorithm for maximum~ matchings
Y Yoshida, M Yamamoto, H Ito
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1002009
Monotone k-submodular function maximization with size constraints
N Ohsaka, Y Yoshida
Advances in Neural Information Processing Systems 28, 2015
972015
Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths
Y Yano, T Akiba, Y Iwata, Y Yoshida
Proceedings of the 22nd ACM international conference on Information …, 2013
932013
Half-integrality, LP-branching, and FPT algorithms
Y Iwata, M Wahlstrom, Y Yoshida
SIAM Journal on Computing 45 (4), 1377-1411, 2016
842016
Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches
Y Yoshida
Proceedings of the 20th ACM SIGKDD international conference on Knowledge …, 2014
842014
Linear-time FPT algorithms via network flow
Y Iwata, K Oka, Y Yoshida
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
812014
Landmark indexing for evaluation of label-constrained reachability queries
LDJ Valstar, GHL Fletcher, Y Yoshida
Proceedings of the 2017 ACM International Conference on Management of Data …, 2017
792017
Linear-time enumeration of maximal k-edge-connected subgraphs in large networks by random contraction
T Akiba, Y Iwata, Y Yoshida
Proceedings of the 22nd ACM international conference on Information …, 2013
732013
Fully dynamic betweenness centrality maintenance on massive networks
T Hayashi, T Akiba, Y Yoshida
Proceedings of the VLDB Endowment 9 (2), 48-59, 2015
712015
Linear programming, width-1 CSPs, and robust satisfaction
G Kun, R O'Donnell, S Tamaki, Y Yoshida, Y Zhou
Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012
712012
Improved Approximation Algorithms for k-Submodular Function Maximization
S Iwata, S Tanigawa, Y Yoshida
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
702016
Cheeger inequalities for submodular transformations
Y Yoshida
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
672019
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20