IEICE Trans

Keyword : algorithms

Max-Min 3-Dispersion Problems Takashi HORIYAMA Shin-ichi NAKANO Toshiki SAITOH Koki SUETSUGU Akira SUZUKI Ryuhei UEHARA Takeaki UNO Kunihiro WASA
Publication: Publication Date: 2021/09/01 Vol. E104-A No. 9 ; pp. 1101-1107 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Algorithms and Data Structures Keyword: algorithms, dispersion problem, facility location,
	Summary \| Full Text:PDF(1.5MB)

A Maximal Local Maximum-Sum Segment Data Structure Yoshifumi SAKAI
Publication: Publication Date: 2018/09/01 Vol. E101-A No. 9 ; pp. 1541-1542 Type of Manuscript: Special Section LETTER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: algorithms, sequence of real numbers, maximum-sum segment,
	Summary \| Full Text:PDF(226.1KB)

A New Algorithm for Fused Blocked Pattern Matching Hua ZHAO Songfeng LU Yan LIU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2013/04/01 Vol. E96-A No. 4 ; pp. 830-832 Type of Manuscript: LETTER Category: Algorithms and Data Structures Keyword: algorithms, pattern matching, blocked pattern matching, fused pattern matching,
	Summary \| Full Text:PDF(72KB)

Secure and Lightweight Localization Method for Wireless Sensor Networks Myung-Ho PARK Ki-Gon NAM Jin Seok KIM Dae Hyun YUM Pil Joong LEE
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2013/03/01 Vol. E96-D No. 3 ; pp. 723-726 Type of Manuscript: LETTER Category: Information Network Keyword: security, wireless sensor networks, secure localization, algorithms,
	Summary \| Full Text:PDF(131.1KB)

Indexed Swap Matching for Short Patterns Hua ZHAO Songfeng LU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2012/01/01 Vol. E95-A No. 1 ; pp. 362-366 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: algorithms, pattern matching, pattern matching with swaps, suffix array, compressed suffix array,
	Summary \| Full Text:PDF(242.6KB)

Optimal Algorithms for Finding Density-Constrained Longest and Heaviest Paths in a Tree Sung Kwon KIM
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2010/11/01 Vol. E93-D No. 11 ; pp. 2989-2994 Type of Manuscript: PAPER Category: Fundamentals of Information Systems Keyword: algorithms, density-constrained paths, heaviest paths, longest paths,
	Summary \| Full Text:PDF(202.7KB)

An Optimal Algorithm towards Successive Location Privacy in Sensor Networks with Dynamic Programming Baokang ZHAO Dan WANG Zili SHAO Jiannong CAO Keith C.C. CHAN Jinshu SU
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2010/03/01 Vol. E93-D No. 3 ; pp. 531-533 Type of Manuscript: Special Section LETTER (Special Section on Trust, Security and Privacy for Pervasive Applications) Category: Keyword: wireless sensor networks, location privacy, algorithms, dynamic programming,
	Summary \| Full Text:PDF(149.3KB)

Intelligent Sensing and Classification in DSR-Based Ad Hoc Networks Tae DEMPSEY Gokhan SAHIN Yu T. (Jade) MORTON
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2009/05/01 Vol. E92-D No. 5 ; pp. 818-825 Type of Manuscript: Special Section PAPER (Special Section on Information and Communication System Security) Category: Ad-Hoc/Sensor Networks Keyword: ad hoc networks, classification, algorithms, DSR,
	Summary \| Full Text:PDF(597.4KB)

A Practical Routing and MAC Framework for Maximum Lifetime Sensor Telemetry Ozgur ERCETIN Ozgur GURBUZ Kerem BULBUL Ertugrul CIFTCIOGLU Aylin AKSU
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2007/11/01 Vol. E90-B No. 11 ; pp. 3146-3157 Type of Manuscript: PAPER Category: Network Keyword: cross-layer design, optimization, algorithms, energy efficient routing, sensor networks, network lifetime,
	Summary \| Full Text:PDF(547.8KB)

Coding Floorplans with Fewer Bits Katsuhisa YAMANAKA Shin-ichi NAKANO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/05/01 Vol. E89-A No. 5 ; pp. 1181-1185 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: graphs, algorithms,
	Summary \| Full Text:PDF(181.7KB)

Using Linear Hybrid Cellular Automata to Attack the Shrinking Generator Pino CABALLERO-GIL Amparo FUSTER-SABATER
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/05/01 Vol. E89-A No. 5 ; pp. 1166-1172 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: cellular automata, cryptanalysis, stream cipher, shrinking generator, algorithms, discrete mathematics,
	Summary \| Full Text:PDF(156.9KB)

Zero-Knowledge Hierarchical Authentication in MANETs Pino CABALLERO-GIL Candelaria HERNANDEZ-GOYA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2006/03/01 Vol. E89-D No. 3 ; pp. 1288-1289 Type of Manuscript: LETTER Category: Application Information Security Keyword: wireless networks, authentication, algorithms,
	Summary \| Full Text:PDF(56.7KB)

Strong Identification Based on a Hard-on-Average Problem Pino CABALLERO-GIL
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2005/05/01 Vol. E88-A No. 5 ; pp. 1117-1121 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: cryptography, computational complexity, algorithms, discrete mathematics,
	Summary \| Full Text:PDF(101.3KB)

Zero-Knowledge Proof for the Independent Set Problem Pino CABALLERO-GIL
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2005/05/01 Vol. E88-A No. 5 ; pp. 1301-1302 Type of Manuscript: Special Section LETTER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: cryptography, computational complexity, algorithms, discrete mathematics,
	Summary \| Full Text:PDF(61.1KB)

Evaluation of the Feedback Guided Dynamic Loop Scheduling (FGDLS) Algorithms Sabin TABIRCA Tatiana TABIRCA Laurence T. YANG Len FREEMAN
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2004/07/01 Vol. E87-D No. 7 ; pp. 1829-1833 Type of Manuscript: Special Section PAPER (Special Section on Hardware/Software Support for High Performance Scientific and Engineering Computing) Category: Distributed, Grid and P2P Computing Keyword: parallel loop scheduling, feedback-guided dynamic loop scheduling, algorithms,
	Summary \| Full Text:PDF(350.4KB)

Algorithms for Submodular Flows Satoru FUJISHIGE Satoru IWATA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2000/03/25 Vol. E83-D No. 3 ; pp. 322-329 Type of Manuscript: INVITED SURVEY PAPER Category: Algorithms for Matroids and Related Discrete Systems Keyword: algorithms, network flows, submodular functions,
	Summary \| Full Text:PDF(332.1KB)

Interval Finding and Its Application to Data Mining Takeshi FUKUDA Yasuhiko MORIMOTO Shinichi MORISHITA Takeshi TOKUYAMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1997/04/25 Vol. E80-A No. 4 ; pp. 620-626 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: computational geometry, algorithms, data mining, interval searching,
	Summary \| Full Text:PDF(615.7KB)

Node-to-Set Disjoint Paths with Optimal Length in Star Graphs Qian-Ping GU Shietung PENG
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1997/04/25 Vol. E80-D No. 4 ; pp. 425-433 Type of Manuscript: Special Section PAPER (Special Issue on Parallel and Distributed Supercomputing) Category: Keyword: algorithms, interconnection networks, node-disjoint paths, star graphs,
	Summary \| Full Text:PDF(766.6KB)

Computing the Minkowski Sum of Monotone Polygons Antonio HERNAN'DEZ-BARRERA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1997/02/25 Vol. E80-D No. 2 ; pp. 218-222 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: algorithms, computational complexity, computational geometry, Minkowski sum, monotone polygon, lower envelope,
	Summary \| Full Text:PDF(403.9KB)

Approximate String Matching with Variable Length Don't Care Characters Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1996/09/25 Vol. E79-D No. 9 ; pp. 1353-1354 Type of Manuscript: LETTER Category: Algorithm and Computational Complexity Keyword: pattern matching, approximate string matching, algorithms, DNA sequence analysis,
	Summary \| Full Text:PDF(160KB)

Fault Tolerant Routing in Toroidal Networks^* Qian-Ping GU Shietung PENG
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1996/08/25 Vol. E79-D No. 8 ; pp. 1153-1159 Type of Manuscript: Special Section PAPER (Special Issue on Architectures, Algorithms and Networks for Massively Parallel Computing) Category: Fault Diagnosis/Tolerance Keyword: algorithms, interconnection networks, node-disjoint paths, node fault tolerant routing,
	Summary \| Full Text:PDF(546.3KB)

Set-To-Set Fault Tolerant Routing in Hypercudes* Qian Ping GU Satoshi OKAWA Shietung PENG
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1996/04/25 Vol. E79-A No. 4 ; pp. 483-488 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: algorithms, interconnection networks, node disjoint path, fault tolerant routing,
	Summary \| Full Text:PDF(458.2KB)

Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs Qian-Ping GU Shietung PENG
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1995/09/25 Vol. E78-D No. 9 ; pp. 1171-1177 Type of Manuscript: PAPER Category: Fault Tolerant Computing Keyword: algorithms, interconnection networks, node disjoint paths, fault tolerant routing,
	Summary \| Full Text:PDF(580.5KB)

Minimax Approach for Logical Configuration in Reconfigurable Virtual Circuit Data Networks Chang Sup SUNG Sung Ki PARK
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1995/08/25 Vol. E78-A No. 8 ; pp. 1029-1033 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: networks, optimization techniques, algorithms,
	Summary \| Full Text:PDF(419.6KB)

Two Algorithms for Modular Exponentiation Using Nonstandard Arithmetics Vassil DIMITROV Todor COOKLEV
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1995/01/25 Vol. E78-A No. 1 ; pp. 82-87 Type of Manuscript: Special Section LETTER (Special Section on Cryptography and Information Security) Category: Keyword: algorithms, data structures and computational complexity, information security and cryptography,
	Summary \| Full Text:PDF(389KB)

Practical Efficiencies of Planar Point Location Algorithms Satoshi KAGAMI Masato EDAHIRO Takao ASANO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1994/04/25 Vol. E77-A No. 4 ; pp. 608-614 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: algorithms, computational geometry, data structures, point location, practical efficiency,
	Summary \| Full Text:PDF(588.8KB)

Experimental Appraisal of Linear and Quadratic Objective Functions Effect on Force Directed Method for Analog Placement Imbaby I.MAHMOUD Koji ASAKURA Takashi NISHIBU Tatsuo OHTSUKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1994/04/25 Vol. E77-A No. 4 ; pp. 719-725 Type of Manuscript: LETTER Category: Computer Aided Design (CAD) Keyword: Computer Aided Design (CAD), analog circutis and signal processing, algorithms,
	Summary \| Full Text:PDF(418KB)

An 0(mn) Algorithm for Embedding Graphs into a 3-Page Book Miki SHIMABARA MIYAUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1994/03/25 Vol. E77-A No. 3 ; pp. 521-526 Type of Manuscript: Special Section PAPER (Special Section on the 6th Karuizawa Workshop on Circuits and Systems) Category: Graphs, Networks and Matroids Keyword: graphs, algorithms, data structures and computational complexity, VLSI design technology,
	Summary \| Full Text:PDF(424.1KB)

Algorithms for Finding the Largest Subtree whose Copies Cover All the Leaves Tatsuya AKUTSU Satoshi KOBAYASHI Koichi HORI Setsuo OHSUGA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1993/06/25 Vol. E76-D No. 6 ; pp. 707-710 Type of Manuscript: LETTER Category: Algorithm and Computational Complexity Keyword: algorithms, macro operator, learning, graph algorithms, subtree,
	Summary \| Full Text:PDF(241.8KB)

Placement, Routing, and Compaction Algorithms for Analog Circuits Imbaby I. MAHMOUD Toru AWASHIMA Koji ASAKURA Tatsuo OHTSUKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1993/06/25 Vol. E76-A No. 6 ; pp. 894-903 Type of Manuscript: Special Section PAPER (Special Section on Papers Selected from 1992 Joint Technical Conference on Circuits/Systems,Computers and Communications (JTC-CSCC'92)) Category: Algorithms for VLSI Design Keyword: computer aided design (CAD), analog circuits and signal processing, algorithms,
	Summary \| Full Text:PDF(789.5KB)

Placement and Routing Algorithms for One-Dimensional CMOS Layout Synthesis with Physical Constraints Katsunori TANI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1992/10/25 Vol. E75-A No. 10 ; pp. 1286-1293 Type of Manuscript: Special Section PAPER (Special Section on VLSI Design and CAD Algorithms) Category: Keyword: computer aided design (CAD), VLSI design technology, algorithms, data structures and computational complexity,
	Summary \| Full Text:PDF(646KB)