default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaito Fujii
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Kaito Fujii
, Yuichi Yoshida:
The Secretary Problem with Predictions. Math. Oper. Res. 49(2): 1241-1262 (2024)- 2023
- [i9]Kaito Fujii:
Bayes correlated equilibria and no-regret dynamics. CoRR abs/2304.05005 (2023) - [i8]Kaito Fujii, Yuichi Yoshida:
The Secretary Problem with Predictions. CoRR abs/2306.08340 (2023) - 2022
- [j3]Thi Ha Ly Dinh, Megumi Kaneko, Kaito Fujii:
Device Selection and Beamforming Optimization in Large-Scale mmWave IoT Networks. IEEE Internet Things J. 9(24): 25395-25408 (2022) - [c6]Kaito Fujii, Shinsaku Sakaue:
Algorithmic Bayesian Persuasion with Combinatorial Actions. AAAI 2022: 5016-5024 - [c5]Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata:
Lazy and Fast Greedy MAP Inference for Determinantal Point Process. NeurIPS 2022 - [i7]Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata:
Lazy and Fast Greedy MAP Inference for Determinantal Point Process. CoRR abs/2206.05947 (2022) - 2021
- [j2]Kaito Fujii, Tasuku Soma, Yuichi Yoshida:
Polynomial-time algorithms for submodular Laplacian systems. Theor. Comput. Sci. 892: 170-186 (2021) - [i6]Kaito Fujii, Shinsaku Sakaue:
Algorithmic Bayesian persuasion with combinatorial actions. CoRR abs/2112.06282 (2021) - 2020
- [c4]Kaito Fujii:
Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions. ICML 2020: 3327-3336 - [i5]Kaito Fujii:
Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions. CoRR abs/2006.01400 (2020)
2010 – 2019
- 2019
- [c3]Kaito Fujii, Shinsaku Sakaue:
Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio. ICML 2019: 2042-2051 - [i4]Kaito Fujii, Shinsaku Sakaue:
Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio. CoRR abs/1904.10748 (2019) - [i3]Kaito Fujii:
An improved algorithm for the submodular secretary problem with a cardinality constraint. CoRR abs/1905.04941 (2019) - 2018
- [c2]Kaito Fujii, Tasuku Soma:
Fast greedy algorithms for dictionary selection with generalized sparsity constraints. NeurIPS 2018: 4749-4758 - [i2]Kaito Fujii, Tasuku Soma, Yuichi Yoshida:
Polynomial-Time Algorithms for Submodular Laplacian Systems. CoRR abs/1803.10923 (2018) - [i1]Kaito Fujii, Tasuku Soma:
Fast greedy algorithms for dictionary selection with generalized sparsity constraints. CoRR abs/1809.02314 (2018) - 2016
- [j1]Kaito Fujii:
Faster approximation algorithms for maximizing a monotone submodular function subject to a b-matching constraint. Inf. Process. Lett. 116(9): 578-584 (2016) - [c1]Kaito Fujii, Hisashi Kashima:
Budgeted stream-based active learning via adaptive submodular maximization. NIPS 2016: 514-522
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
