|
| Keyword : algorithm
| |
| |
|
A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs
Yasuko MATSUI Kenta OZEKI | Publication:
Publication Date: 2021/03/01
Vol. E104-D
No. 3 ;
pp. 389-391
Type of Manuscript:
Special Section LETTER (Special Section on Foundations of Computer Science — New Trends of Theory of Computation and Algorithm —)
Category:
Keyword:
enumeration, algorithm, spanning subgraph, edge-connectivity, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
On r-Gatherings on the Line
Toshihiro AKAGI Shin-ichi NAKANO | Publication:
Publication Date: 2017/03/01
Vol. E100-D
No. 3 ;
pp. 428-433
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Theoretical Computer Science —)
Category:
Keyword:
algorithm, facility location, | | | Summary | Full Text:PDF | |
|
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Outerplanar Graphs
Shin-ichi NAKAYAMA Shigeru MASUYAMA | Publication:
Publication Date: 2017/03/01
Vol. E100-D
No. 3 ;
pp. 434-443
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Theoretical Computer Science —)
Category:
Keyword:
spanning tree, outerplanar graph, algorithm, | | | Summary | Full Text:PDF | |
| |
|
A Linear Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Cographs
Shin-ichi NAKAYAMA Shigeru MASUYAMA | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2016/10/01
Vol. E99-D
No. 10 ;
pp. 2574-2584
Type of Manuscript:
PAPER
Category: Fundamentals of Information Systems
Keyword:
spanning tree, cograph, algorithm, | | | Summary | Full Text:PDF | |
| |
| |
| |
|
Network Clock System that Ensures a High Level of Frequency Accuracy
Shuichi FUJIKAWA | Publication: IEICE TRANSACTIONS on Communications
Publication Date: 2015/11/01
Vol. E98-B
No. 11 ;
pp. 2212-2226
Type of Manuscript:
PAPER
Category: Transmission Systems and Transmission Equipment for Communications
Keyword:
clock, synchronization, evaluation, algorithm, MTIE, GPS, | | | Summary | Full Text:PDF | |
| |
|
Another Optimal Binary Representation of Mosaic Floorplans
Katsuhisa YAMANAKA Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2015/06/01
Vol. E98-A
No. 6 ;
pp. 1223-1224
Type of Manuscript:
Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
algorithm, coding, decoding, floorplan, mosaic floorplan, | | | Summary | Full Text:PDF | |
|
Expressing Algorithms as Concise as Possible via Computability Logic
Keehang KWON | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/06/01
Vol. E97-A
No. 6 ;
pp. 1385-1387
Type of Manuscript:
Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
tasks, algorithm, agents, computability logic, | | | Summary | Full Text:PDF | |
|
Efficient Enumeration of All Ladder Lotteries with k Bars
Katsuhisa YAMANAKA Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/06/01
Vol. E97-A
No. 6 ;
pp. 1163-1170
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
algorithm, enumeration, ladder lottery, family tree, | | | Summary | Full Text:PDF | |
|
Convex Grid Drawings of Plane Graphs with Pentagonal Contours
Kazuyuki MIURA | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2014/03/01
Vol. E97-D
No. 3 ;
pp. 413-420
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science —New Trends in Theory of Computation and Algorithm—)
Category: Graph Algorithms
Keyword:
algorithm, convex grid drawing, graph drawing, plane graph, triconnected, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
|
Pruning-Based Trace Signal Selection Algorithm for Data Acquisition in Post-Silicon Validation
Kang ZHAO Jinian BIAN | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2012/06/01
Vol. E95-A
No. 6 ;
pp. 1030-1040
Type of Manuscript:
PAPER
Category: VLSI Design Technology and CAD
Keyword:
algorithm, silicon debug, state restoration, trace signal selection, | | | Summary | Full Text:PDF | |
| |
|
A Fast Systematic Optimized Comparison Algorithm for CNU Design of LDPC Decoders
Jui-Hui HUNG Sau-Gee CHEN | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2011/11/01
Vol. E94-A
No. 11 ;
pp. 2246-2253
Type of Manuscript:
Special Section PAPER (Special Section on Smart Multimedia & Communication Systems)
Category: Communication Theory and Signals
Keyword:
channel coding, LDPC decoder, comparison operation, algorithm, hardware, | | | Summary | Full Text:PDF | |
| |
| |
|
An Optimal Algorithm for Solving the Towers of Hanoi Problem with the Least Storage Used
Yu-Kumg CHEN Chen-An FANG Fan-Chieh CHENG | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2011/02/01
Vol. E94-D
No. 2 ;
pp. 240-242
Type of Manuscript:
Special Section LETTER (Special Section on Foundations of Computer Science -- Mathematical Foundations and Applications of Algorithms and Computer Science --)
Category:
Keyword:
Towers of Hanoi, data structure, algorithm, mathematic, game, | | | Summary | Full Text:PDF | |
|
An Efficient LDPC Decoder Architecture with a High-Performance Decoding Algorithm
Jui-Hui HUNG Sau-Gee CHEN | Publication: IEICE TRANSACTIONS on Communications
Publication Date: 2010/11/01
Vol. E93-B
No. 11 ;
pp. 2980-2989
Type of Manuscript:
PAPER
Category: Fundamental Theories for Communications
Keyword:
channel coding, LDPC, decoder, algorithm, hardware, | | | Summary | Full Text:PDF | |
|
Sorted Sector Covering Combined with Image Condensation -- An Efficient Method for Local Dimming of Direct-Lit and Edge-Lit LCDs
Marc ALBRECHT Andreas KARRENBAUER Tobias JUNG Chihao XU | Publication: IEICE TRANSACTIONS on Electronics
Publication Date: 2010/11/01
Vol. E93-C
No. 11 ;
pp. 1556-1563
Type of Manuscript:
INVITED PAPER (Special Section on Electronic Displays)
Category:
Keyword:
local dimming, backlight, algorithm, LED, edge-lit, side-lit, direct-lit, interaction between LEDs, crosstalk, optimization, high power saving, efficient processor, | | | Summary | Full Text:PDF | |
| |
| |
| |
|
A Simple Canonical Code for Fullerene Graphs
Naoki SHIMOTSUMA Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/12/01
Vol. E92-A
No. 12 ;
pp. 3398-3400
Type of Manuscript:
LETTER
Category: Algorithms and Data Structures
Keyword:
graph, algorithm, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
|
Extended Algorithm for Calculating Routes with Include Route Constraint in IP Networks
Rie HAYASHI Eiji OKI Kohei SHIOMOTO | Publication: IEICE TRANSACTIONS on Communications
Publication Date: 2007/12/01
Vol. E90-B
No. 12 ;
pp. 3677-3679
Type of Manuscript:
LETTER
Category: Network
Keyword:
include route, algorithm, cost, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
|
Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size
Takehiro ITO Kazuya GOTO Xiao ZHOU Takao NISHIZEKI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2007/02/01
Vol. E90-D
No. 2 ;
pp. 449-456
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science)
Category: Graph Algorithms
Keyword:
algorithm, choice partition, lower bound, maximum partition problem, minimum partition problem, multi-weighted graph, partial k-tree, series-parallel graph, uniform partition, upper bound, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
Generating All Series-Parallel Graphs
Shin-ichiro KAWANO Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/05/01
Vol. E88-A
No. 5 ;
pp. 1129-1135
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
algorithm, enumeration, series-parallel graph, | | | Summary | Full Text:PDF | |
| |
|
Unified Phase Compiler by Use of 3-D Representation Space
Takefumi MIYOSHI Nobuhiko SUGINO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/04/01
Vol. E88-A
No. 4 ;
pp. 838-845
Type of Manuscript:
Special Section PAPER (Special Section on Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
Category:
Keyword:
optimized compiler, VLIW, DSP, algorithm, | | | Summary | Full Text:PDF | |
| |
| |
| |
|
Distance between Rooted and Unordered Trees Based on Vertex and Edge Mappings
Shaoming LIU | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2004/05/01
Vol. E87-A
No. 5 ;
pp. 1034-1041
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
tree, graph, structure, pattern, distance, similarity, mapping, algorithm, pattern matching, | | | Summary | Full Text:PDF | |
| |
|
Efficient Generation of Plane Triangulations with Specified Maximum Degree
Hiroyuki TANAKA Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2004/02/01
Vol. E87-D
No. 2 ;
pp. 330-336
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science)
Category:
Keyword:
graph, algorithm, plane graph, generation, | | | Summary | Full Text:PDF | |
|
An Algorithm to Use in Adaptive Wideband Duplexer for Software Radio
Shyama KANNANGARA Michael FAULKNER | Publication: IEICE TRANSACTIONS on Communications
Publication Date: 2003/12/01
Vol. E86-B
No. 12 ;
pp. 3452-3455
Type of Manuscript:
Special Section PAPER (Special Issue on Software Defined Radio Technology and Its Applications)
Category:
Keyword:
duplexer, cancellation, algorithm, software radio, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
|
An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs
Shin-ichi NAKAYAMA Shigeru MASUYAMA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2003/05/01
Vol. E86-A
No. 5 ;
pp. 1019-1026
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
algorithm, vertex ranking, spanning tree, interval graph, | | | Summary | Full Text:PDF | |
|
Efficient Generation of Plane Triangulations with a Degree Constraint
Hiroyuki TANAKA Zhangjian LI Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2003/04/01
Vol. E86-A
No. 4 ;
pp. 829-834
Type of Manuscript:
Special Section PAPER (Special Section of Selected Papers from the 15th Workshop on Circuits and Systems in Karuizawa)
Category:
Keyword:
graph, algorithm, plane graph, generation, | | | Summary | Full Text:PDF | |
| |
|
Algorithms for Multicolorings of Partial k-Trees
Takehiro ITO Takao NISHIZEKI Xiao ZHOU | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/02/01
Vol. E86-D
No. 2 ;
pp. 191-200
Type of Manuscript:
Special Section PAPER (Special Issue on Selected Papers from LA Symposium)
Category: Graph Algorithms
Keyword:
algorithm, multicoloring, partial k-tree, | | | Summary | Full Text:PDF | |
| |
| |
|
A Linear-Time Algorithm for Five-Partitioning Five-Connected Internally Triangulated Plane Graphs
Sayaka NAGAI Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/09/01
Vol. E84-A
No. 9 ;
pp. 2330-2337
Type of Manuscript:
PAPER
Category: Algorithms and Data Structures
Keyword:
graph, algorithm, partition, | | | Summary | Full Text:PDF | |
|
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
Sayaka NAGAI Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/05/01
Vol. E84-A
No. 5 ;
pp. 1102-1109
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
graph, algorithm, independent spanning trees, | | | 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 | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
Efficient Algorithms for Finding Largest Similar Substructures in Unordered Trees
Shaoming LIU Eiichi TANAKA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/04/25
Vol. E79-A
No. 4 ;
pp. 428-440
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
algorithm, complexity, distance, similar structure, tree, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
|
An On-Line Scheduler for ASIC Manufacturing Line Management
Tadao TAKEDA Satoshi TAZAWA Kou WADA Eisuke ARAI | Publication: IEICE TRANSACTIONS on Electronics
Publication Date: 1995/03/25
Vol. E78-C
No. 3 ;
pp. 241-247
Type of Manuscript:
Special Section PAPER (Special Issue on Sub-1/4 Micron Device and Process Technologies)
Category:
Keyword:
scheduler, ASIC, TAT, algorithm, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
|
