default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakanori Maehara
Person information
- affiliation: Facebook AI, London, UK
- affiliation: RIKEN Center for Advanced Intelligence Project, Tokyo, Japan
- affiliation: Shizuoka University, Department of Mathematical and Systems Engineering, Japan
- affiliation (PhD 2012): University of Tokyo, Graduate School of Information Science and Technology, Japan
SPARQL queries 
🛈 Please note that only 54% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c49]Takanori Maehara, Hoang NT:
Deep Homomorphism Networks. NeurIPS 2024- 2023
- [i39]Abdalgader Abubaker, Takanori Maehara, Madhav Nimishakavi, Vassilis Plachouras:
Self-Supervised Pretraining for Heterogeneous Hypergraph Neural Networks. CoRR abs/2311.11368 (2023) - 2022
- [j17]Takanori Maehara, So Nakashima
:
Rank axiom of modular supermatroids: A connection with directional DR submodular functions. Adv. Appl. Math. 134: 102304 (2022) - [j16]Takanori Maehara, Kazutoshi Ando:
Optimal Algorithm for Finding Representation of Subtree Distance. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9): 1203-1210 (2022) - [j15]Takanori Maehara, So Nakashima, Yutaro Yamaguchi:
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice. Math. Program. 194(1): 85-119 (2022) - 2021
- [c48]Soh Kumabe, Takanori Maehara:
Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property. IWOCA 2021: 428-441 - [c47]Takanori Maehara, Hoang NT:
Learning on Random Balls is Sufficient for Estimating (Some) Graph Parameters. NeurIPS 2021: 1126-1141 - [c46]Soh Kumabe, Takanori Maehara:
r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. WALCOM 2021: 154-165 - [i38]Kenshin Abe, Takanori Maehara, Issei Sato:
Abelian Neural Networks. CoRR abs/2102.12232 (2021) - [i37]Takanori Maehara, Hoang NT:
Learning on Random Balls is Sufficient for Estimating (Some) Graph Parameters. CoRR abs/2111.03317 (2021) - 2020
- [j14]Mario Coutino, Sundeep Prabhakar Chepuri, Takanori Maehara, Geert Leus:
Fast Spectral Approximation of Structured Graphs with Applications to Graph Filtering. Algorithms 13(9): 214 (2020) - [j13]Takanori Maehara, Yutaro Yamaguchi:
Stochastic packing integer programs with few queries. Math. Program. 182(1): 141-174 (2020) - [j12]Mario Coutino, Elvin Isufi, Takanori Maehara, Geert Leus:
State-Space Network Topology Identification From Partial Observations. IEEE Trans. Signal Inf. Process. over Networks 6: 211-225 (2020) - [c45]Kazuto Fukuchi, Satoshi Hara, Takanori Maehara:
Faking Fairness via Stealthily Biased Sampling. AAAI 2020: 412-419 - [c44]Soh Kumabe, Takanori Maehara:
Convexity of Hypergraph Matching Game. AAMAS 2020: 663-671 - [c43]Mario Coutino, Elvin Isufi, Takanori Maehara, Geert Leus:
State-Space Based Network Topology Identification. EUSIPCO 2020: 1055-1059 - [c42]Yoichi Sasaki, Takanori Maehara, Takumi Akazaki, Kazeto Yamamoto, Kunihiko Sadamasa:
Solving Weighted Abduction via Max-SAT Solvers. FLAIRS 2020: 142-147 - [c41]Hoang Nguyen, Takanori Maehara:
Graph Homomorphism Convolution. ICML 2020: 7306-7316 - [c40]Hoang NT, Takanori Maehara, Tsuyoshi Murata:
Revisiting Graph Neural Networks: Graph Filtering Perspective. ICPR 2020: 8376-8383 - [c39]Soh Kumabe, Takanori Maehara:
Convexity of b-matching Games. IJCAI 2020: 261-267 - [c38]Yoshifumi Seki, Takanori Maehara:
A Method to Anonymize Business Metrics to Publishing Implicit Feedback Datasets. RecSys 2020: 4-12 - [i36]Yoichi Sasaki, Kosuke Akimoto, Takanori Maehara:
Learning Directly from Grammar Compressed Text. CoRR abs/2002.12570 (2020) - [i35]Akihiro Yabe, Takanori Maehara:
Tightly Robust Optimization via Empirical Domain Reduction. CoRR abs/2003.00248 (2020) - [i34]Hoang NT, Takanori Maehara:
Graph Homomorphism Convolution. CoRR abs/2005.01214 (2020) - [i33]Hoang NT, Takanori Maehara, Tsuyoshi Murata:
Stacked Graph Filter. CoRR abs/2011.10988 (2020) - [i32]Soh Kumabe, Takanori Maehara:
r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. CoRR abs/2012.02981 (2020)
2010 – 2019
- 2019
- [j11]Takuro Fukunaga, Takanori Maehara:
Computing a tree having a small vertex cover. Theor. Comput. Sci. 791: 48-61 (2019) - [c37]Takanori Maehara, Yuma Inoue:
Group Decision Diagram (GDD): A Compact Representation for Permutations. AAAI 2019: 2986-2994 - [c36]So Nakashima, Takanori Maehara:
Subspace Selection via DR-Submodular Maximization on Lattices. AAAI 2019: 4618-4625 - [c35]Mohammed Alsuhaibani, Takanori Maehara, Danushka Bollegala:
Joint Learning of Hierarchical Word Embeddings from a Corpus and a Taxonomy. AKBC 2019 - [c34]Junjie Chen, Takanori Maehara:
Chance-Constrained Submodular Knapsack Problem. COCOON 2019: 103-114 - [c33]Ben Chugg, Takanori Maehara:
Submodular Stochastic Probing with Prices. CoDIT 2019: 60-66 - [c32]Masakazu Ishihata, Takanori Maehara:
Exact Bernoulli Scan Statistics using Binary Decision Diagrams. IJCAI 2019: 5737-5743 - [c31]Satoshi Hara, Atsushi Nitanda, Takanori Maehara:
Data Cleansing for Models Trained with SGD. NeurIPS 2019: 4215-4224 - [c30]Satoshi Hara, Takanori Maehara:
Convex Hull Approximation of Nearly Optimal Lasso Solutions. PRICAI (2) 2019: 350-363 - [c29]Soh Kumabe, Takanori Maehara, Ryoma Sin'ya:
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. WALCOM 2019: 248-260 - [i31]Kazuto Fukuchi, Satoshi Hara, Takanori Maehara:
Pretending Fair Decisions via Stealthily Biased Sampling. CoRR abs/1901.08291 (2019) - [i30]Takanori Maehara, Kazutoshi Ando:
Optimal Algorithm to Reconstruct a Tree from a Subtree Distance. CoRR abs/1902.08742 (2019) - [i29]Ikumi Hide, Soh Kumabe, Takanori Maehara:
Incorrect implementations of the Floyd-Warshall algorithm give correct solutions after three repeats. CoRR abs/1904.01210 (2019) - [i28]Hoang NT, Takanori Maehara:
Revisiting Graph Neural Networks: All We Have is Low-Pass Filters. CoRR abs/1905.09550 (2019) - [i27]Satoshi Hara, Atsushi Nitanda, Takanori Maehara:
Data Cleansing for Models Trained with SGD. CoRR abs/1906.08473 (2019) - [i26]Takanori Maehara, Yutaro Yamaguchi:
Stochastic Monotone Submodular Maximization with Queries. CoRR abs/1907.04083 (2019) - [i25]Soh Kumabe, Takanori Maehara:
PTAS and Exact Algorithms for r-Gathering Problems on Tree. CoRR abs/1907.04087 (2019) - [i24]Soh Kumabe, Takanori Maehara:
r-Gather Clustering and r-Gathering on Spider: FPT Algorithms and Hardness. CoRR abs/1907.04088 (2019) - [i23]Takanori Maehara, So Nakashima, Yutaro Yamaguchi:
Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice - Continuous Greedy Algorithm on Median Complex -. CoRR abs/1907.04279 (2019) - [i22]Akihiro Yabe, Takanori Maehara:
Empirical Hypothesis Space Reduction. CoRR abs/1909.01576 (2019) - [i21]Takanori Maehara, Hoang NT:
A Simple Proof of the Universality of Invariant/Equivariant Graph Neural Networks. CoRR abs/1910.03802 (2019) - 2018
- [j10]Takanori Maehara, Naoki Marumo, Kazuo Murota:
Continuous relaxation for discrete DC programming. Math. Program. 169(1): 199-219 (2018) - [j9]Taro Takaguchi, Takanori Maehara, Ken-ichi Kawarabayashi, Masashi Toyoda:
Existence of outsiders as a characteristic of online communication networks. Netw. Sci. 6(4): 431-447 (2018) - [j8]Danushka Bollegala, Vincent Atanasov, Takanori Maehara, Ken-ichi Kawarabayashi:
ClassiNet - Predicting Missing Features for Short-Text Classification. ACM Trans. Knowl. Discov. Data 12(5): 55:1-55:29 (2018) - [c28]Takayuki Osogami, Rudy Raymond, Akshay Goel, Tomoyuki Shirai, Takanori Maehara:
Dynamic Determinantal Point Processes. AAAI 2018: 3868-3875 - [c27]Mario Coutino, Elvin Isufi, Takanori Maehara, Geert Leus:
On The Limits of Finite-Time Distributed Consensus Through Successive Local Linear Operations. ACSSC 2018: 993-997 - [c26]Masaaki Imaizumi, Takanori Maehara, Yuichi Yoshida:
Statistically Efficient Estimation for Non-Smooth Probability Densities. AISTATS 2018: 978-987 - [c25]Tatsunori Taniai, Takanori Maehara:
Neural Inverse Rendering for General Reflectance Photometric Stereo. ICML 2018: 4864-4873 - [c24]Takanori Maehara, Atsuhiro Narita, Jun Baba, Takayuki Kawabata:
Optimal Bidding Strategy for Brand Advertising. IJCAI 2018: 424-432 - [c23]Yutaro Yamaguchi, Takanori Maehara:
Stochastic Packing Integer Programs with Few Queries. SODA 2018: 293-310 - [i20]Tatsunori Taniai, Takanori Maehara:
Neural Photometric Stereo Reconstruction for General Reflectance Surfaces. CoRR abs/1802.10328 (2018) - [i19]Danushka Bollegala, Vincent Atanasov, Takanori Maehara, Ken-ichi Kawarabayashi:
ClassiNet - Predicting Missing Features for Short-Text Classification. CoRR abs/1804.05260 (2018) - [i18]So Nakashima, Takanori Maehara:
Subspace Selection via DR-Submodular Maximization on Lattices. CoRR abs/1805.07455 (2018) - [i17]Satoshi Hara, Kouichi Ikeno, Tasuku Soma, Takanori Maehara:
Maximally Invariant Data Perturbation as Explanation. CoRR abs/1806.07004 (2018) - [i16]Masakazu Ishihata, Takanori Maehara, Tomas Rigaux:
Algorithmic Meta-Theorems for Monotone Submodular Maximization. CoRR abs/1807.04575 (2018) - [i15]Soh Kumabe, Takanori Maehara, Ryoma Sin'ya:
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. CoRR abs/1807.04942 (2018) - [i14]Ben Chugg, Takanori Maehara:
Submodular Stochastic Probing with Prices. CoRR abs/1810.01730 (2018) - [i13]Junpei Komiyama, Takanori Maehara:
A Simple Way to Deal with Cherry-picking. CoRR abs/1810.04996 (2018) - [i12]Satoshi Hara, Takanori Maehara:
Convex Hull Approximation of Nearly Optimal Lasso Solutions. CoRR abs/1810.05992 (2018) - 2017
- [c22]Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi:
Optimal Pricing for Submodular Valuations with Bounded Curvature. AAAI 2017: 622-628 - [c21]Satoshi Hara, Takanori Maehara:
Enumerate Lasso Solutions for Feature Selection. AAAI 2017: 1985-1991 - [c20]Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi:
Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling. AAAI 2017: 1992-1999 - [c19]Masaaki Imaizumi, Takanori Maehara, Kohei Hayashi:
On Tensor Train Rank Minimization : Statistical Efficiency and Scalable Algorithm. NIPS 2017: 3930-3939 - [c18]Takanori Maehara, Hirofumi Suzuki, Masakazu Ishihata:
Exact Computation of Influence Spread by Binary Decision Diagrams. WWW 2017: 947-956 - [i11]Takanori Maehara, Hirofumi Suzuki, Masakazu Ishihata:
Exact Computation of Influence Spread by Binary Decision Diagrams. CoRR abs/1701.01540 (2017) - [i10]Takuro Fukunaga, Takanori Maehara:
Computing a tree having a small vertex cover. CoRR abs/1701.08897 (2017) - [i9]Satoshi Takabe, Takanori Maehara, Koji Hukushima:
Typical Approximation Performance for Maximum Coverage Problem. CoRR abs/1706.08721 (2017) - [i8]Takanori Maehara, Yutaro Yamaguchi:
Stochastic Packing Integer Programs with Few Queries. CoRR abs/1707.04020 (2017) - 2016
- [j7]Ryosuke Nishi, Taro Takaguchi, Keigo Oka, Takanori Maehara, Masashi Toyoda, Ken-ichi Kawarabayashi, Naoki Masuda:
Reply trees in Twitter: data analysis and branching process models. Soc. Netw. Anal. Min. 6(1): 26:1-26:13 (2016) - [c17]Takanori Maehara, Kohei Hayashi, Ken-ichi Kawarabayashi:
Expected Tensor Decomposition with Stochastic Gradient Descent. AAAI 2016: 1919-1925 - [c16]Danushka Bollegala, Mohammed Alsuhaibani, Takanori Maehara, Ken-ichi Kawarabayashi:
Joint Word Representation Learning Using a Corpus and a Semantic Lexicon. AAAI 2016: 2690-2696 - [c15]Takuro Fukunaga, Takanori Maehara:
Computing a Tree Having a Small Vertex Cover. COCOA 2016: 77-91 - [i7]Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi:
Optimal Pricing for Submodular Valuations with Bounded Curvature. CoRR abs/1611.07605 (2016) - 2015
- [j6]Takanori Maehara, Kazuo Murota:
Valuated matroid-based algorithm for submodular welfare problem. Ann. Oper. Res. 229(1): 565-590 (2015) - [j5]Takanori Maehara, Kazuo Murota:
A framework of discrete DC programming by discrete convex analysis. Math. Program. 152(1-2): 435-466 (2015) - [j4]Takanori Maehara:
Risk averse submodular utility maximization. Oper. Res. Lett. 43(5): 526-529 (2015) - [c14]Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi:
Lagrangian Decomposition Algorithm for Allocating Marketing Channels. AAAI 2015: 1144-1150 - [c13]Danushka Bollegala, Takanori Maehara, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Learning Word Representations from Relational Graphs. AAAI 2015: 2146-2152 - [c12]Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi:
Unsupervised Cross-Domain Word Representation Learning. ACL (1) 2015: 730-740 - [c11]Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi:
Scalable SimRank join algorithm. ICDE 2015: 603-614 - [c10]Takanori Maehara, Akihiro Yabe, Ken-ichi Kawarabayashi:
Budget Allocation Problem with Multiple Advertisers: A Game Theoretic View. ICML 2015: 428-437 - [c9]Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi:
Embedding Semantic Relations into Word Representations. IJCAI 2015: 1222-1228 - [c8]Kohei Hayashi, Takanori Maehara, Masashi Toyoda, Ken-ichi Kawarabayashi:
Real-Time Top-R Topic Detection on Twitter with Topic Hijack Filtering. KDD 2015: 417-426 - [c7]Naoto Ohsaka, Takanori Maehara, Ken-ichi Kawarabayashi:
Efficient PageRank Tracking in Evolving Networks. KDD 2015: 875-884 - [c6]Takanori Maehara, Naoki Marumo, Kazuo Murota:
Continuous Relaxation for Discrete DC Programming. MCO (1) 2015: 181-190 - [c5]Yasushi Kawase, Takanori Maehara, Ken-ichi Kawarabayashi:
Scalable sensor localization via ball-decomposition algorithm. Networking 2015: 1-9 - [i6]Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi:
Embedding Semantic Relations into Word Representations. CoRR abs/1505.00161 (2015) - [i5]Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi:
Unsupervised Cross-Domain Word Representation Learning. CoRR abs/1505.07184 (2015) - [i4]Danushka Bollegala, Mohammed Alsuhaibani, Takanori Maehara, Ken-ichi Kawarabayashi:
Joint Word Representation Learning using a Corpus and a Semantic Lexicon. CoRR abs/1511.06438 (2015) - 2014
- [j3]Takanori Maehara, Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi:
Computing Personalized PageRank Quickly by Exploiting Graph Structures. Proc. VLDB Endow. 7(12): 1023-1034 (2014) - [c4]Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi:
Efficient SimRank computation via linearizationPublication of this article pending inquiry. KDD 2014: 1426-1435 - [c3]Takuya Akiba, Takanori Maehara, Ken-ichi Kawarabayashi:
Network structural analysis via core-tree-decomposition Publication of this article pending inquiry. KDD 2014: 1476-1485 - [c2]Mitsuru Kusumoto, Takanori Maehara, Ken-ichi Kawarabayashi:
Scalable similarity search for SimRank. SIGMOD Conference 2014: 325-336 - [i3]Taro Takaguchi, Takanori Maehara, Masashi Toyoda, Ken-ichi Kawarabayashi:
Existence of outsiders as a characteristic of online communication networks. CoRR abs/1411.7091 (2014) - [i2]Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi:
Efficient SimRank Computation via Linearization. CoRR abs/1411.7228 (2014) - [i1]Danushka Bollegala, Takanori Maehara, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Learning Word Representations from Relational Graphs. CoRR abs/1412.2378 (2014) - 2011
- [j2]Takanori Maehara, Kazuo Murota:
Algorithm for Error-Controlled Simultaneous Block-Diagonalization of Matrices. SIAM J. Matrix Anal. Appl. 32(2): 605-620 (2011) - 2010
- [j1]Takanori Maehara, Kazuo Murota:
Error-controlling algorithm for simultaneous block-diagonalization and its application to independent component analysis. JSIAM Lett. 2: 131-134 (2010) - [c1]Harold W. Gutch, Takanori Maehara, Fabian J. Theis:
Second Order Subspace Analysis and Simple Decompositions. LVA/ICA 2010: 370-377
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-02-15 01:21 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:
