|
Assigning Proximity Facilities for Gatherings
Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2024/03/01
Vol. E107-D
No. 3 ;
pp. 383-385
Type of Manuscript:
PAPER
Category: Fundamentals of Information Systems
Keyword:
algorithms, facility location, gathering problem, | | | Summary | Full Text:PDF | |
|
A Fast Algorithm for Finding a Maximal Common Subsequence of Multiple Strings
Miyuji HIROTA Yoshifumi SAKAI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2023/09/01
Vol. E106-A
No. 9 ;
pp. 1191-1194
Type of Manuscript:
Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category: Algorithms and Data Structures
Keyword:
algorithms, longest common subsequence, multiple strings, | | | Summary | Full Text:PDF | |
|
|
|
|
|
A Maximal Local Maximum-Sum Segment Data Structure
Yoshifumi SAKAI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
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 | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
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 | |
|
|
|
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 | |
|
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 | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
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 | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|