Takanori Maehara

According to our database1, Takanori Maehara authored at least 82 papers between 2010 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice.
Math. Program., 2022

Rank axiom of modular supermatroids: A connection with directional DR submodular functions.
Adv. Appl. Math., 2022

2021
Abelian Neural Networks.
CoRR, 2021

r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Learning on Random Balls is Sufficient for Estimating (Some) Graph Parameters.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020
State-Space Network Topology Identification From Partial Observations.
IEEE Trans. Signal Inf. Process. over Networks, 2020

Stochastic packing integer programs with few queries.
Math. Program., 2020

Stacked Graph Filter.
CoRR, 2020

Graph Homomorphism Convolution.
CoRR, 2020

Tightly Robust Optimization via Empirical Domain Reduction.
CoRR, 2020

Learning Directly from Grammar Compressed Text.
CoRR, 2020

Fast Spectral Approximation of Structured Graphs with Applications to Graph Filtering.
Algorithms, 2020

A Method to Anonymize Business Metrics to Publishing Implicit Feedback Datasets.
Proceedings of the RecSys 2020: Fourteenth ACM Conference on Recommender Systems, 2020

Convexity of b-matching Games.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Revisiting Graph Neural Networks: Graph Filtering Perspective.
Proceedings of the 25th International Conference on Pattern Recognition, 2020

Graph Homomorphism Convolution.
Proceedings of the 37th International Conference on Machine Learning, 2020

Solving Weighted Abduction via Max-SAT Solvers.
Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, 2020

State-Space Based Network Topology Identification.
Proceedings of the 28th European Signal Processing Conference, 2020

Convexity of Hypergraph Matching Game.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Faking Fairness via Stealthily Biased Sampling.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Computing a tree having a small vertex cover.
Theor. Comput. Sci., 2019

A Simple Proof of the Universality of Invariant/Equivariant Graph Neural Networks.
CoRR, 2019

Empirical Hypothesis Space Reduction.
CoRR, 2019

Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice - Continuous Greedy Algorithm on Median Complex -.
CoRR, 2019

r-Gather Clustering and r-Gathering on Spider: FPT Algorithms and Hardness.
CoRR, 2019

PTAS and Exact Algorithms for r-Gathering Problems on Tree.
CoRR, 2019

Stochastic Monotone Submodular Maximization with Queries.
CoRR, 2019

Revisiting Graph Neural Networks: All We Have is Low-Pass Filters.
CoRR, 2019

Incorrect implementations of the Floyd-Warshall algorithm give correct solutions after three repeats.
CoRR, 2019

Optimal Algorithm to Reconstruct a Tree from a Subtree Distance.
CoRR, 2019

Pretending Fair Decisions via Stealthily Biased Sampling.
CoRR, 2019

Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Convex Hull Approximation of Nearly Optimal Lasso Solutions.
Proceedings of the PRICAI 2019: Trends in Artificial Intelligence, 2019

Data Cleansing for Models Trained with SGD.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Exact Bernoulli Scan Statistics using Binary Decision Diagrams.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Submodular Stochastic Probing with Prices.
Proceedings of the 6th International Conference on Control, 2019

Chance-Constrained Submodular Knapsack Problem.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Joint Learning of Hierarchical Word Embeddings from a Corpus and a Taxonomy.
Proceedings of the 1st Conference on Automated Knowledge Base Construction, 2019

Subspace Selection via DR-Submodular Maximization on Lattices.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Group Decision Diagram (GDD): A Compact Representation for Permutations.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
ClassiNet - Predicting Missing Features for Short-Text Classification.
ACM Trans. Knowl. Discov. Data, 2018

Existence of outsiders as a characteristic of online communication networks.
Netw. Sci., 2018

Continuous relaxation for discrete DC programming.
Math. Program., 2018

A Simple Way to Deal with Cherry-picking.
CoRR, 2018

Algorithmic Meta-Theorems for Monotone Submodular Maximization.
CoRR, 2018

Maximally Invariant Data Perturbation as Explanation.
CoRR, 2018

Neural Photometric Stereo Reconstruction for General Reflectance Surfaces.
CoRR, 2018

Optimal Bidding Strategy for Brand Advertising.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Neural Inverse Rendering for General Reflectance Photometric Stereo.
Proceedings of the 35th International Conference on Machine Learning, 2018

Statistically Efficient Estimation for Non-Smooth Probability Densities.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

On The Limits of Finite-Time Distributed Consensus Through Successive Local Linear Operations.
Proceedings of the 52nd Asilomar Conference on Signals, Systems, and Computers, 2018

Dynamic Determinantal Point Processes.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Typical Approximation Performance for Maximum Coverage Problem.
CoRR, 2017

Exact Computation of Influence Spread by Binary Decision Diagrams.
Proceedings of the 26th International Conference on World Wide Web, 2017

On Tensor Train Rank Minimization : Statistical Efficiency and Scalable Algorithm.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Optimal Pricing for Submodular Valuations with Bounded Curvature.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Enumerate Lasso Solutions for Feature Selection.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Reply trees in Twitter: data analysis and branching process models.
Soc. Netw. Anal. Min., 2016

Expected Tensor Decomposition with Stochastic Gradient Descent.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Joint Word Representation Learning Using a Corpus and a Semantic Lexicon.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Risk averse submodular utility maximization.
Oper. Res. Lett., 2015

A framework of discrete DC programming by discrete convex analysis.
Math. Program., 2015

Valuated matroid-based algorithm for submodular welfare problem.
Ann. Oper. Res., 2015

Scalable sensor localization via ball-decomposition algorithm.
Proceedings of the 14th IFIP Networking Conference, 2015

Efficient PageRank Tracking in Evolving Networks.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Real-Time Top-R Topic Detection on Twitter with Topic Hijack Filtering.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Embedding Semantic Relations into Word Representations.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Budget Allocation Problem with Multiple Advertisers: A Game Theoretic View.
Proceedings of the 32nd International Conference on Machine Learning, 2015

Scalable SimRank join algorithm.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

Unsupervised Cross-Domain Word Representation Learning.
Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing, 2015

Lagrangian Decomposition Algorithm for Allocating Marketing Channels.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Learning Word Representations from Relational Graphs.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Computing Personalized PageRank Quickly by Exploiting Graph Structures.
Proc. VLDB Endow., 2014

Efficient SimRank Computation via Linearization.
CoRR, 2014

Scalable similarity search for SimRank.
Proceedings of the International Conference on Management of Data, 2014

Efficient SimRank computation via linearizationPublication of this article pending inquiry.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Network structural analysis via core-tree-decomposition Publication of this article pending inquiry.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

2011
Algorithm for Error-Controlled Simultaneous Block-Diagonalization of Matrices.
SIAM J. Matrix Anal. Appl., 2011

2010
Error-controlling algorithm for simultaneous block-diagonalization and its application to independent component analysis.
JSIAM Lett., 2010

Second Order Subspace Analysis and Simple Decompositions.
Proceedings of the Latent Variable Analysis and Signal Separation, 2010


  Loading...