3 citations · 4 across the 2 of their papers we have counts for
4 papers
Spanning Tree Constrained Determinantal Point Processes are Hard to (Approximately) Evaluate
Tatsuya Matsuoka, Naoto Ohsaka
We consider determinantal point processes (DPPs) constrained by spanning trees. Given a graph and a positive semi-definite matrix indexed by , a spanning-…
Predictive Optimization with Zero-Shot Domain Adaptation
Tomoya Sakai, Naoto Ohsaka
Prediction in a new domain without any training sample, called zero-shot domain adaptation (ZSDA), is an important task in domain adaptation. While prediction in a new domain has g…
The Solution Distribution of Influence Maximization: A High-level Experimental Study on Three Algorithmic Approaches
Naoto Ohsaka
Influence maximization is among the most fundamental algorithmic problems in social influence analysis. Over the last decade, a great effort has been devoted to developing efficien…
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka
There are many classical problems in P whose time complexities have not been improved over the past decades. Recent studies of "Hardness in P" have revealed that, for several of su…