Takeshi Shinohara

According to our database1, Takeshi Shinohara authored at least 66 papers between 1982 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Fast Filtering for Similarity Search Using Conjunctive Enumeration of Sketches in Order of Hamming Distance.
Proceedings of the 13th International Conference on Pattern Recognition Applications and Methods, 2024

2022
Nearest-neighbor Search from Large Datasets using Narrow Sketches.
Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods, 2022

2020
Pivot Selection for Narrow Sketches by Optimization Algorithms.
Proceedings of the Similarity Search and Applications - 13th International Conference, 2020

2019
Annealing by Increasing Resampling in the Unified View of Simulated Annealing.
Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods, 2019

Annealing by Increasing Resampling.
Proceedings of the Pattern Recognition Applications and Methods, 2019

Fast Nearest Neighbor Search with Narrow 16-bit Sketch.
Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods, 2019

Fast Filtering for Nearest Neighbor Search by Sketch Enumeration Without Using Matching.
Proceedings of the AI 2019: Advances in Artificial Intelligence, 2019

2018
Nearest Neighbor Search using Sketches as Quantized Images of Dimension Reduction.
Proceedings of the 7th International Conference on Pattern Recognition Applications and Methods, 2018

2017
Pivot Selection for Dimension Reduction using Annealing by Increasing Resampling.
Proceedings of the Lernen, 2017

2016
Fast Hilbert Sort Algorithm Without Using Hilbert Indices.
Proceedings of the Similarity Search and Applications - 9th International Conference, 2016

2015
High Dimensional Similarity Search with Bundled Query Processing on Hilbert R-Tree.
Proceedings of the ICPRAM 2015, 2015

2014
Central Point Selection in Dimension Reduction Projection Simple-Map with Binary Quantization.
Proceedings of the New Frontiers in Artificial Intelligence, 2014

2010
On the Configuration of the Similarity Search Data Structure D-Index for High Dimensional Objects.
Proceedings of the Computational Science and Its Applications, 2010

Accelerating Video Identification by Skipping Queries with a Compact Metric Cache.
Proceedings of the Computational Science and Its Applications, 2010

2009
Towards Low Carbon Similarity Search with Compressed Sketches.
Proceedings of the VLDB 2009 PhD Workshop. Co-located with the 35th International Conference on Very Large Data Bases (VLDB 2009). Lyon, 2009

Efficient Similarity Search by Reducing I/O with Compressed Sketches.
Proceedings of the Second International Workshop on Similarity Search and Applications, 2009

2008
Developments from enquiries into the learnability of the pattern languages from positive data.
Theor. Comput. Sci., 2008

Foreword.
Theor. Comput. Sci., 2008

A Tree Distance Function Based on Multi-sets.
Proceedings of the New Frontiers in Applied Data Mining, 2008

2007
Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes.
Proceedings of the Seventh IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2007), September 30, 2007

2006
Finding Consensus Patterns in Very Scarce Biosequence Samples from Their Minimal Multiple Generalizations.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2006

Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

On approximate matching of programs for protecting libre software.
Proceedings of the 2006 conference of the Centre for Advanced Studies on Collaborative Research, 2006

2005
Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences.
Proceedings of the Discovery Science, 8th International Conference, 2005

Inferring Unions of the Pattern Languages by the Most Fitting Covers.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004
Model Analysis of Digital Copyright Piracy on P2P Networks.
Proceedings of the 2004 Symposium on Applications and the Internet Workshops (SAINT 2004 Workshops), 2004

2002
Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts.
Proceedings of the String Processing and Information Retrieval, 2002

On Dimension Reduction Mappings for Approximate Retrieval of Multi-dimensional Data.
Proceedings of the Progress in Discovery Science, 2002

2001
Speed-up of Aho-Corasick Pattern Matching Machines by Rearranging States.
Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

An Efficient Derivation for Elementary Formal Systems Based on Partial Unification.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

2000
Inductive inference of unbounded unions of pattern languages from positive data.
Theor. Comput. Sci., 2000

Approximate Retrieval of High-Dimensional Date with L<sub>1</sub> Metric by Spacial Indexing.
New Gener. Comput., 2000

Polynomial-time Learning of Elementary Formal Systems.
New Gener. Comput., 2000

Speed-Up of Approximate String Matching Using Lossy Compression.
Proceedings of the Information Modelling and Knowledge Bases XII: Tenth European-Japanese Conference on Information Modelling and Knowledge Bases, 2000

Collaboration with Lean Media: how open-source software succeeds.
Proceedings of the CSCW 2000, 2000

Speeding Up Pattern Matching by Text Compression.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
H-Map: A Dimension Reduction Mapping for Approximate Retrieval of Multi-dimensional Data.
Proceedings of the Discovery Science, 1999

1998
Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries.
Ann. Math. Artif. Intell., 1998

Approximate Retrieval of High-Dimensional Data by Spatial Indexing.
Proceedings of the Discovery Science, 1998

1997
Learning Unions of Tree Patterns Using Queries.
Theor. Comput. Sci., 1997

1995
Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems.
Proceedings of the Machine Intelligence 15, 1995

BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences.
Proceedings of the Third International Conference on Intelligent Systems for Molecular Biology, 1995

Pattern Inference.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Editor's Introduction.
Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994
Rich Classes Inferable from Positive Data: Length-Bounded Elementary Formal Systems
Inf. Comput., February, 1994

Special Issue on Algorithmic Learning Theory.
New Gener. Comput., 1994

Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data.
Proceedings of the STACS 94, 1994

1993
A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns.
New Gener. Comput., 1993

1992
Learning Elementary Formal Systems.
Theor. Comput. Sci., 1992

A Generalization of the Least General Generalization.
Proceedings of the Machine Intelligence 13, 1992

Polynomial Time Inference of a Subclass of Context-Free Transformations.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

Efficient Inductive Inference of Primitive Prologs from Positive Data.
Proceedings of the Algorithmic Learning Theory, Third Workshop, 1992

1991
Inductive Inference of Monotonic Formal Systems from Positive Data.
New Gener. Comput., 1991

A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages.
Proceedings of the Nonmonotonic and Inductive Logic, 1991

More About Learning Elementary Formal Systems.
Proceedings of the Nonmonotonic and Inductive Logic, 1991

The Correct Definition of Finite Elasticity: Corrigendum to Identification of Unions.
Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

Which classes of elementary formal systems are polynomial-time learnable.
Proceedings of the Algorithmic Learning Theory, 2nd International Workshop, 1991

Polynomial-time inference of unions of tree pattern languages.
Proceedings of the Algorithmic Learning Theory, 2nd International Workshop, 1991

1990
Inductive Inference from Positive Data is Powerful.
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989
Elementary Formal System as a Unifying Framework for Language Learning.
Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1986
Efficient Storage and Retrieval of Very Large Document Databases.
Proceedings of the Second International Conference on Data Engineering, 1986

1985
Efficient pattern matching algorithms and their applications to text information systems.
Proceedings of the Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications), 1985

Some problems on inductive inference from positive data.
Proceedings of the Mathematical Methods of Specification and Synthesis of Software Systems '85, 1985

1984
A Run-Time Efficient Realization of Aho-Corasick Pattern Matching Machines.
New Gener. Comput., 1984

GENAS: a database system for nucleic acid sequence analysis.
Nucleic Acids Res., 1984

1982
Polynomial Time Inference of Extended Regular Pattern Languages.
Proceedings of the RIMS Symposium on Software Science and Engineering, 1982


  Loading...