# Yuichi Yoshida

According to our database

Collaborative distances:

^{1}, Yuichi Yoshida authored at least 109 papers between 1995 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepages:

#### On csauthors.net:

## Bibliography

2019

Influence Analytics in Graphs.

Proceedings of the Encyclopedia of Big Data Technologies., 2019

Constant-Query Testability of Assignments to Constraint Satisfaction Problems.

SIAM J. Comput., 2019

A characterization of constant-sample testable properties.

Random Struct. Algorithms, 2019

Estimating 3D Position of Strongly Occluded Object with Semi-Real Time by Using Auxiliary 3D Points in Occluded Space.

IJAT, 2019

Sensitivity Analysis of Centralities on Unweighted Networks.

Proceedings of the World Wide Web Conference, 2019

Estimating Walk-Based Similarities Using Random Walk.

Proceedings of the World Wide Web Conference, 2019

Variational Inference of Penalized Regression with Submodular Functions.

Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

Cheeger Inequalities for Submodular Transformations.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Spectral Sparsification of Hypergraphs.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory.

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

2018

Computational Aspects of the Preference Cores of Supermodular Two-Scenario Cooperative Games.

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Spectral Normalization for Generative Adversarial Networks.

Proceedings of the 6th International Conference on Learning Representations, 2018

A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity.

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms.

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices.

Proceedings of the Approximation, 2018

Guaranteed Sufficient Decrease for Stochastic Variance Reduced Gradient Optimization.

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

Statistically Efficient Estimation for Non-Smooth Probability Densities.

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

Using k-Way Co-Occurrences for Learning Word Embeddings.

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Constant Velocity 3D Convolution.

Proceedings of the 2018 International Conference on 3D Vision, 2018

2017

Image Retrieval Framework Based on Dual Representation Descriptor.

IEICE Transactions, 2017

Portfolio Optimization for Influence Spread.

Proceedings of the 26th International Conference on World Wide Web, 2017

Landmark Indexing for Evaluation of Label-Constrained Reachability Queries.

Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Fitting Low-Rank Tensors in Constant Time.

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint.

Proceedings of the Approximation, 2017

Regret Ratio Minimization in Multi-Objective Submodular Function Maximization.

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Non-Monotone DR-Submodular Function Maximization.

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Random-Radius Ball Method for Estimating Closeness Centrality.

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Computing Least Cores of Supermodular Cooperative Games.

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Half-integrality, LP-branching, and FPT Algorithms.

SIAM J. Comput., 2016

Analytics on complex networks: scalable solutions for empirical questions (NII Shonan Meeting 2016-1).

NII Shonan Meet. Rep., 2016

Testing properties of functions on finite groups.

Random Struct. Algorithms, 2016

Dynamic Influence Analysis in Evolving Networks.

PVLDB, 2016

New Types of Markers and the Integration of M-CubITS Pedestrian WYSIWYAS Navigation Systems for Advanced WYSIWYAS Navigation Environments.

IEICE Transactions, 2016

A Characterization of Constant-Sample Testable Properties.

Electronic Colloquium on Computational Complexity (ECCC), 2016

Nonlinear Laplacian for Digraphs and its Applications to Network Analysis.

Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, 2016

Gowers Norm, Function Limits, and Parameter Estimation.

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Non-convex Compressed Sensing with the Sum-of-Squares Method.

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Improved Approximation Algorithms for

*k*-Submodular Function Maximization.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Minimizing Quadratic Functions in Constant Time.

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Maximizing Monotone Submodular Functions over the Integer Lattice.

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

Efficient Algorithms for Spanning Tree Centrality.

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Testing Assignments to Constraint Satisfaction Problems.

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Fast Eigen Matching.

Proceedings of the British Machine Vision Conference 2016, 2016

2015

Fully Dynamic Betweenness Centrality Maintenance on Massive Networks.

PVLDB, 2015

Generalized River Crossing Problems.

Theory Comput. Syst., 2015

Testing the Supermodular-Cut Condition.

Algorithmica, 2015

A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice.

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Monotone k-Submodular Function Maximization with Size Constraints.

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

On the Equivalence among Problems of Bounded Width.

Proceedings of the Algorithms - ESA 2015, 2015

Distributed Multiplicative Weights Methods for DCOP.

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

Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling.

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Generalized skew bisubmodularity: A characterization and a min-max theorem.

Discrete Optimization, 2014

Semi-Strong Colouring of Intersecting Hypergraphs.

Combinatorics, Probability & Computing, 2014

Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling.

Proceedings of the 23rd International World Wide Web Conference, 2014

A characterization of locally testable affine-invariant properties via decomposition theorems.

Proceedings of the Symposium on Theory of Computing, 2014

Linear-Time FPT Algorithms via Network Flow.

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches.

Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems.

Proceedings of the Innovations in Theoretical Computer Science, 2014

Parameterized testability.

Proceedings of the Innovations in Theoretical Computer Science, 2014

Keypoint detection by cascaded fast.

Proceedings of the 2014 IEEE International Conference on Image Processing, 2014

Testing Forest-Isomorphism in the Adjacency List Model.

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Robust Approximation of Temporal CSP.

Proceedings of the Approximation, 2014

Asymmetric Feature Representation for Object Recognition in Client Server System.

Proceedings of the Computer Vision - ACCV 2014, 2014

Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations.

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Distance Computation Between Binary Code and Real Vector for Efficient Keypoint Matching.

IPSJ Trans. Computer Vision and Applications, 2013

The trends in EMR and CPOE adoption in Japan under the national strategy.

I. J. Medical Informatics, 2013

Testing subdivision-freeness: property testing meets structural graph theory.

Proceedings of the Symposium on Theory of Computing Conference, 2013

Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra.

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Fast exact shortest-path distance queries on large networks by pruned landmark labeling.

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

Mining for Analogous Tuples from an Entity-Relation Graph.

Proceedings of the IJCAI 2013, 2013

Testing Linear-Invariant Function Isomorphism.

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

An Algebraic Characterization of Testable Boolean CSPs.

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths.

Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction.

Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012

Testing the (s, t)-disconnectivity of graphs and digraphs.

Theor. Comput. Sci., 2012

Algorithms for Finding a Maximum Non-

*k*-Linked Graph.
SIAM J. Discrete Math., 2012

Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems.

SIAM J. Comput., 2012

On the distance between non-isomorphic groups.

Eur. J. Comb., 2012

Testing Assignments of Boolean CSPs.

Electronic Colloquium on Computational Complexity (ECCC), 2012

Constant-Time Approximation Algorithms for the Knapsack Problem.

Proceedings of the Theory and Applications of Models of Computation, 2012

Linear programming, width-1 CSPs, and robust satisfaction.

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Constant-Time Algorithms for Sparsity Matroids.

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs.

Proceedings of the Third International Conference on Networking and Computing, 2012

Algorithms and Complexity of Generalized River Crossing Problems.

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Partially Symmetric Functions Are Efficiently Isomorphism-Testable.

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Testing List H-homomorphisms.

Proceedings of the 27th Conference on Computational Complexity, 2012

Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues.

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

Augmenting Training Samples with a Large Number of Rough Segmentation Datasets.

IEICE Transactions, 2011

Dimensionality Reduction for Histogram Features Based on Supervised Non-negative Matrix Factorization.

IEICE Transactions, 2011

Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP.

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

CARD: Compact And Real-time Descriptors.

Proceedings of the IEEE International Conference on Computer Vision, 2011

Algorithms for Finding a Maximum Non-k-linked Graph.

Proceedings of the Algorithms - ESA 2011, 2011

Property Testing for Cyclic Groups and Beyond.

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs.

Proceedings of the 26th Annual IEEE Conference on Computational Complexity, 2011

2010

Testing

*k*-edge-connectivity of digraphs.
J. Systems Science & Complexity, 2010

Query-Number Preserving Reductions and Linear Lower Bounds for Testing.

IEICE Transactions, 2010

Testing Outerplanarity of Bounded Degree Graphs.

Proceedings of the Approximation, 2010

A Query Efficient Non-adaptive Long Code Test with Perfect Completeness.

Proceedings of the Approximation, 2010

Conjunctive Filter: Breaking the Entropy Barrier.

Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

2009

An improved constant-time approximation algorithm for maximum matchings.

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Multiclass VisualRank: image ranking method in clustered subsets based on visual features.

Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2009

2008

Property Testing on k-Vertex-Connectivity of Graphs.

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Context-based interaction using pointing movements recognition for an intelligent home service robot.

Proceedings of the IEEE RO-MAN 2007, 2007

Mobile Magic Hand: Camera Phone Based Interaction Using Visual Code and Optical Flow.

Proceedings of the Human-Computer Interaction. Interaction Platforms and Techniques, 2007

2005

Mobile Reacher Interface for Intuitive Information Navigation.

Proceedings of the Human-Computer Interaction, 2005

2002

The Musical Session System with the Visual Interface.

Proceedings of the 2002 International Computer Music Conference, 2002

1997

Reconstruction of a signal using the spectrum-reversal technique.

IEEE Trans. Signal Processing, 1997

1995

Analysis for palatalized articulation of [s] sounds using synthetic speech.

Proceedings of the Fourth European Conference on Speech Communication and Technology, 1995