#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1965

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Shin-ichi Minato, Nagisa Ishiura, Shuzo Yajima
- DAC
- 1990

The efficiency of Boolean function manipulation depends on the form of representation of Boolean functions. <italic>Binary Decision Diagrams (BDD's)</italic> are graph representations proposed by Akers and Bryant. BDD's have some properties which can be used to enable efficient Boolean function manipulation.
In this paper, we describe a technique of more… (More)

- Naofumi Takagi, Shuzo Yajima
- IEEE Trans. Computers
- 1992

- Hiroyuki Ochi, Koichi Yasuoka, Shuzo Yajima
- ICCAD
- 1993

P This paper presents an e cient method for manipulating very large Shared inary-Deciston Diagrams (SBDD'S) which am too large to be stored within main memory. In contrast that the conventional depth-first aigorithm causes random access of memory,, the proposed method is intended to cause sequential access of memory. The main idea o our method is level-i… (More)

- Kazuhisa Hosaka, Yasuhiko Takenaga, Shuzo Yajima
- ISAAC
- 1994

- Naofumi Takagi, Hiroto Yasuura, Shuzo Yajima
- IEEE Trans. Computers
- 1985

- Nagisa Ishiura, Hiroshi Sawada, Shuzo Yajima
- ICCAD
- 1991

We ropose in this paper a new exact algorithm and gr aduay improvement methods of minimizing binary decision diagrams (BDD's). In the exact minimization algorithm the o timum order is searched by the exchanges o! variabyes of BDD's based on the framework of Friedman's algorithm. The use of BDD representation of a given function and intermediate functions… (More)

- Hassanin Al-barhamtoshy, Sherif Abdou, +8 authors Virginia H. Lucas
- 2012

The percentage of people who produce a neat and clear handwriting is declining sharply. The traditional approach for handwriting teaching is to have a dedicated teacher for long hours of handwriting practice. Unfortunately, this is not feasible in many cases. In this paper we introduce an automated tool for teaching Arabic handwriting using tablet PCs and… (More)

- Naofumi Takagi, Tohru Asada, Shuzo Yajima
- IEEE Trans. Computers
- 1991

- Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
- ISAAC
- 1993

- Narao Nakatsu, Yahiko Kambayashi, Shuzo Yajima
- Acta Informatica
- 1982

Efficient algorithms for computing the longest common subsequence (LCS for short) are discussed. O(pn) algorithm and O(p(m-p) log n) algorithm [Hirschberg 1977] seem to be best among previously known algorithms, where p is the length of an LCS and m and n are the lengths of given two strings (m≦n). There are many applications where the expected length of an… (More)