H
Haruhisa Takahashi
Researcher at University of Electro-Communications
Publications - 44
Citations - 1098
Haruhisa Takahashi is an academic researcher from University of Electro-Communications. The author has contributed to research in topics: Support vector machine & Object detection. The author has an hindex of 9, co-authored 44 publications receiving 1009 citations.
Papers
More filters
Journal ArticleDOI
The worst-case time complexity for generating all maximal cliques and computational experiments
TL;DR: A depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in the Bron-Kerbosch algorithm, which proves that its worst-case time complexity is O(3n/3) for an n-vertex graph.
Journal Article
The Worst-Case Time Complexity for Generating All Maximal Cliques (Extended Abstract)
TL;DR: A depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in Bron and Kerbosch’s algorithm, which proves that its worst-case time complexity is O(3 n/3) for an n-vertex graph.
Book ChapterDOI
The Worst-Case Time Complexity for Generating All Maximal Cliques
TL;DR: In this paper, a depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in Bron and Kerbosch's algorithm, is presented.
Journal Article
Kernel Selection for the Support Vector Machine
Journal ArticleDOI
An Efficient Support Vector Machine Learning Method with Second-Order Cone Programming for Large-Scale Problems
TL;DR: A new fast learning algorithm for the support vector machine (SVM) based on the technique of second-order cone programming, which is much faster than the quadratic programming solver LOQO if the dimension of the decomposed matrix is small enough compared to that of the kernel matrix.