IEICE Trans

Toshihide IBARAKI

Collision Probability in an In-Line Equipment Model under Erlang Distribution Eishi CHIBA Hiroshi FUJIWARA Yoshiyuki SEKIGUCHI Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2013/03/01 Vol. E96-D No. 3 pp. 400-407 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —) Category: Keyword: stochastic model, collision probability, Erlang distribution, closed form, approximation,
	Summary \| Full Text:PDF

A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns Kazuya HARAGUCHI Mutsunori YAGIURA Endre BOROS Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2008/03/01 Vol. E91-D No. 3 pp. 781-788 Type of Manuscript: PAPER Category: Algorithm Theory Keyword: frequent/infrequent item sets, association rules, knowledge discovery, probabilistic analysis,
	Summary \| Full Text:PDF

Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge Kazuya HARAGUCHI Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/05/01 Vol. E89-A No. 5 pp. 1284-1291 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: classification, Boolean functions, partially defined Boolean functions, learning algorithms, iteratively composed features,
	Summary \| Full Text:PDF

Approximability of the Minimum Maximal Matching Problem in Planar Graphs Hiroshi NAGAMOCHI Yukihiro NISHIDA Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2003/12/01 Vol. E86-A No. 12 pp. 3251-3258 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: graph algorithm, approximation algorithm, matching, planar graph, separator,
	Summary \| Full Text:PDF

An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns Shunji UMETANI Mutsunori YAGIURA Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2003/05/01 Vol. E86-A No. 5 pp. 1093-1102 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: cutting stock problem, pattern minimization, local search, linear programming,
	Summary \| Full Text:PDF

A Note on Approximating the Survivable Network Design Problem in Hypergraphs Liang ZHAO Hiroshi NAGAMOCHI Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2002/02/01 Vol. E85-D No. 2 pp. 322-326 Type of Manuscript: Special Section PAPER (Special Issue on Selected Papers from LA Symposium) Category: Keyword: survivable network design problem, approximation algorithm, connectivity, graph, hypergraph,
	Summary \| Full Text:PDF

Solving the Single-Vehicle Scheduling Problems for All Home Locations under Depth-First Routing on a Tree Hiroshi NAGAMOCHI Koji MOCHIZUKI Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2001/05/01 Vol. E84-A No. 5 pp. 1135-1143 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: vehicle-scheduling, tree, algorithm, location problem,
	Summary \| Full Text:PDF

A 7/3-Approximation for the Minimum Weight 3-Connected Spanning Subgraph Problem Hiroshi NAGAMOCHI Katsuhiro SEKI Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/04/25 Vol. E83-A No. 4 pp. 687-691 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: undirected graph, vertex-connectivity, approximation algorithm, spanning subgraph,
	Summary \| Full Text:PDF

FOREWORD Toshihide IBARAKI Masafumi YAMASHITA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2000/03/25 Vol. E83-D No. 3 pp. 319-321 Type of Manuscript: FOREWORD Category: Keyword:
	Summary \| Full Text:PDF

A Simple Proof of a Minimum Cut Algorithm and Its Applications Hiroshi NAGAMOCHI Toshimasa ISHII Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1999/10/25 Vol. E82-A No. 10 pp. 2231-2236 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: graph, edge-connectivity, minimum cut, flow, MA-ordering, dynamic tree structure,
	Summary \| Full Text:PDF

Data Analysis by Positive Decision Trees Kazuhisa MAKINO Takashi SUDA Hirotaka ONO Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1999/01/25 Vol. E82-D No. 1 pp. 76-88 Type of Manuscript: Special Section PAPER (Special Issue on New Generation Database Technologies) Category: Theoretical Aspects Keyword: decision trees, ID3, MID, extensions, positive functions, quasi-positive functions, data mining, knowledge discovery and data analysis,
	Summary \| Full Text:PDF

Reachability Problems of Random Digraphs Yushi UNO Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1998/12/25 Vol. E81-A No. 12 pp. 2694-2702 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: random digraph, reachability, transitive closure, upper and lower bounds on reachability,
	Summary \| Full Text:PDF

FOREWORD Toshihide IBARAKI Osamu WATANABE
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1992/01/25 Vol. E75-D No. 1 pp. 3-4 Type of Manuscript: FOREWORD Category: Keyword:
	Summary \| Full Text:PDF

Complexity of the Optimum Join Order Problem in Relational Databases Yushi UNO Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1991/07/25 Vol. E74-D No. 7 pp. 2067-2075 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword:
	Summary \| Full Text:PDF

The Computational Complexity of the m-Center Problems on the Plane Shigeru MASUYAMA Toshihide IBARAKI Toshiharu HASEGAWA
Publication: IEICE TRANSACTIONS (1976-1990) Publication Date: 1981/02/25 Vol. E64-E No. 2 pp. 57-64 Type of Manuscript: PAPER Category: Miscellaneous Keyword:
	Summary \| Full Text:PDF

NP-Complete Diagnosis Problems on System Graphs Toshihide IBARAKI Tsunehiko KAMEDA Shunichi TOIDA
Publication: IEICE TRANSACTIONS (1976-1990) Publication Date: 1979/02/25 Vol. E62-E No. 2 pp. 81-88 Type of Manuscript: PAPER Category: Computers Keyword:
	Summary \| Full Text:PDF

Parallel-Machine Scheduling Problem with Unit Processing Time When Jobs Have Ready and Due Times Toshihide IBARAKI Hiroshi KISE Hisashi MINE
Publication: IEICE TRANSACTIONS (1976-1990) Publication Date: 1976/07/25 Vol. E59-E No. 7 pp. 1-6 Type of Manuscript: PAPER Category: Computers Keyword:
	Summary \| Full Text:PDF