Takeshi Tokuyama

According to our database1, Takeshi Tokuyama authored at least 121 papers between 1990 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Model-Agnostic Explanations for Decisions Using Minimal Patterns.
Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2019: Theoretical Neural Computation, 2019

CapsuleNet for Micro-Expression Recognition.
Proceedings of the 14th IEEE International Conference on Automatic Face & Gesture Recognition, 2019

Consistent Digital Curved Rays and Pseudoline Arrangements.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Colored spanning graphs for set visualization.
Comput. Geom., 2018

Large-Scale Taxonomy Problem: a Mixed Machine Learning Approach.
Proceedings of the SIGIR 2018 Workshop On eCommerce co-located with the 41st International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2018), 2018

2017
Buyback problem with discrete concave valuation functions.
Discret. Optim., 2017

Efficiently Correcting Matrix Products.
Algorithmica, 2017

2016
Algoritihmcs for Beyond Planar Graphs (NII Shonan Meeting 2016-17).
NII Shonan Meet. Rep., 2016

Distance interior ratio: A new shape signature for 2D shape retrieval.
Pattern Recognit. Lett., 2016

2015
Jiri Matousek 1963 - 2015.
Bull. EATCS, 2015

2014
Efficient algorithms for network localization using cores of underlying graphs.
Theor. Comput. Sci., 2014

Order-preserving matching.
Theor. Comput. Sci., 2014

Guest Editors' foreword.
Theor. Comput. Sci., 2014

Base-object location problems for base-monotone regions.
Theor. Comput. Sci., 2014

A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

A Generalization of the Convex Kakeya Problem.
Algorithmica, 2014

Weight Balancing on Boundaries and Skeletons.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
A feature-word-topic model for image annotation and retrieval.
ACM Trans. Web, 2013

Base Location Problems for Base-Monotone Regions.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

A Multiple Instance Learning Approach to Image Annotation with Saliency Map.
Proceedings of the KDIR/KMIS 2013 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval and the International Conference on Knowledge Management and Information Sharing, Vilamoura, Algarve, Portugal, 19, 2013

Classified-Distance Based Shape Descriptor for Application to Image Retrieval.
Proceedings of the Computer Analysis of Images and Patterns, 2013

2012
Algorithms for computing the maximum weight region decomposable into elementary shapes.
Comput. Vis. Image Underst., 2012

2011
Cascade of Multi-level Multi-instance Classifiers for Image Annotation.
Proceedings of the KDIR 2011, 2011

2010
Effect of Corner Information in Simultaneous Placement of k Rectangles and Tableaux.
Discret. Math. Algorithms Appl., 2010

Distance k-sectors exist.
Comput. Geom., 2010

Foreword.
Algorithmica, 2010

Zone diagrams in Euclidean spaces and in other normed spaces.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Distance <i>k</i>-sectors exist.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Effect of Corner Information in Simultaneous Placement of <i>K</i> Rectangles and Tableaux.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

A feature-word-topic model for image annotation.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009
Consistent Digital Rays.
Discret. Comput. Geom., 2009

All Farthest Neighbors in the Presence of Highways and Obstacles.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Directional Geometric Routing on Mobile Ad Hoc Networks.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
Minimizing interference of a wireless ad-hoc network in a plane.
Theor. Comput. Sci., 2008

Dense subgraph problems with output-density conditions.
ACM Trans. Algorithms, 2008

Optimal Insertion of a Segment Highway in a City Metric.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge.
SIAM J. Comput., 2007

Recent Progress on Combinatorics and Algorithms for Low Discrepancy Roundings.
Graphs Comb., 2007

Fixed-Parameter Tractability for Non-Crossing Spanning Trees.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Distance Trisector of Segments and Zone Diagram of Segments in a Plane.
Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

Voronoi Diagram with Respect to Criteria on Vision Information.
Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

2006
Efficiently pricing European-Asian options - ultimate implementation and analysis of the AMO algorithm.
Inf. Process. Lett., 2006

Polyline Fitting of Planar Points under Min-sum Criteria.
Int. J. Comput. Geom. Appl., 2006

Efficient Algorithms for Constructing a Pyramid from a Terrain.
IEICE Trans. Inf. Syst., 2006

Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve.
Algorithmica, 2006

The distance trisector curve.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Angular Voronoi Diagram with Applications.
Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

SDI: Shape Distribution Indicator and Its Application to Find Interrelationships Between Physical Activity Tests and Other Medical Measures.
Proceedings of the AI 2006: Advances in Artificial Intelligence, 2006

OSDM: Optimized Shape Distribution Method.
Proceedings of the Advanced Data Mining and Applications, Second International Conference, 2006

2005
Combinatorics and algorithms for low-discrepancy roundings of a real sequence.
Theor. Comput. Sci., 2005

A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options.
Algorithmica, 2005

2004
The structure and number of global roundings of a graph.
Theor. Comput. Sci., 2004

Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition.
Graphs Comb., 2004

On Geometric Structure of Global Roundings for Graphs and Range Spaces.
Proceedings of the Algorithm Theory, 2004

Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
Matrix Rounding under the L<sup>p</sup>-Discrepancy Measure and Its Application to Digital Halftoning.
SIAM J. Comput., 2003

Quantum Algorithms for Intersection and Proximity Problems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Efficient algorithms for the minimum diameter bridge problem.
Comput. Geom., 2003

Enumerating Global Roundings of an Outerplanar Graph.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002
Algorithms for Finding Attribute Value Group for Binary Segmentation of Categorical Databases.
IEEE Trans. Knowl. Data Eng., 2002

Guest Editor's Foreword.
Int. J. Comput. Geom. Appl., 2002

Labeling Points with Rectangles of Various Shapes.
Int. J. Comput. Geom. Appl., 2002

Parametric Polymatroid Optimization and Its Geometric Applications.
Int. J. Comput. Geom. Appl., 2002

K-Levels of Concave Surfaces.
Discret. Comput. Geom., 2002

Optimal Online Algorithms for an Electronic Commerce Money Distribution System.
Algorithmica, 2002

Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization.
Proceedings of the Geometry, 2002

Combinatorial and Geometric Problems Related to Digital Halftoning.
Proceedings of the Geometry, 2002

Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Data Mining with optimized two-dimensional association rules.
ACM Trans. Database Syst., 2001

Efficient Algorithms for Optimization-Based Image Segmentation.
Int. J. Comput. Geom. Appl., 2001

A unified scheme for detecting fundamental curves in binary edge images.
Comput. Geom., 2001

Minimax parametric optimization problems and multi-dimensional parametric searching.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Notes on computing peaks in k-levels and parametric spanning trees.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000
Optimal Roundings of Sequences and Matrices.
Nord. J. Comput., 2000

Greedily Finding a Dense Subgraph.
J. Algorithms, 2000

On the Complexities of the Optimal Rounding Problems of Sequences and Matrices.
Proceedings of the Algorithm Theory, 2000

Labeling Points with Rectangles of Various Shapes.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999
Finding Subsets Maximizing Minimum Structures.
SIAM J. Discret. Math., 1999

Mining Optimized Association Rules for Numeric Attributes.
J. Comput. Syst. Sci., 1999

Optimal On-line Algorithms for an Electronic Commerce Money Distribution System.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming.
Proceedings of the Discovery Science, 1999

1998
How to Cut Pseudoparabolas into Segments.
Discret. Comput. Geom., 1998

Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets.
Discret. Comput. Geom., 1998

Consecutive Interval Query and Dynamic Programming on Intervals.
Discret. Appl. Math., 1998

Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases.
Proceedings of the VLDB'98, 1998

Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Convertibility among Grid Filling Curves.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Application of Algorithm Theory to Data Mining.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997
Orthogonal Queries in Segments.
Algorithmica, 1997

Covering Points in the Plane by <i>k</i>-Tours: Towards a Polynomial Time Approximation Scheme for General <i>k</i>.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Computing Optimized Rectilinear Regions for Association Rules.
Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), 1997

A Characterization of Planar Graphs by Pseudo-Line Arrangements.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996
Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules.
Proceedings of the VLDB'96, 1996

Polynomial-Time Solutions to Image Segmentation.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

SONAR: System for Optimized Numeric AssociationRules.
Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1996

Data Mining Using Two-Dimensional Optimized Accociation Rules: Scheme, Algorithms, and Visualization.
Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1996

Interval Finding and Its Application to Data Mining.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1995
Efficient Algorithms for the Hitchcock Transportation Problem.
SIAM J. Comput., 1995

Geometric Algorithms for the Minimum Cost Assignment Problem.
Random Struct. Algorithms, 1995

An Improved Algorithm for the Traveler's Problem.
J. Algorithms, 1995

On Minimum and Maximum Spanning Trees of Linearly Moving Points.
Discret. Comput. Geom., 1995

How to Cut Pseudo-Parabolas into Segments.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
A Note on Polynomial Arithmetic Analogue of Halton Sequences.
ACM Trans. Model. Comput. Simul., 1994

Walking on an arrangement topologically.
Int. J. Comput. Geom. Appl., 1994

Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications.
Discret. Comput. Geom., 1994

Complexity of Projected Images of Convex Subdivisions.
Comput. Geom., 1994

Orthogonal Queries in Segments and Triangles.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Topological Walk Revisited.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
Splitting a Configuration in a Simplex.
Algorithmica, 1993

Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing.
Algorithmica, 1993

Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Circuit Partitioning Algorithms based on Geometry Model.
Proceedings of the Algorithmic Aspects of VLSI Layout, 1993

1991
Bounding the number of k-faces in arrangements of hyperplanes.
Discret. Appl. Math., 1991

Circuit Partitioning Algorithms: Graph Model versus Geometry Model.
Proceedings of the ISA '91 Algorithms, 1991

1990
Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990


  Loading...