Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Eito, Hasegawa"'
Publikováno v:
Journal of Interconnection Networks. 22
The minimum stretch spanning tree problem for a connected graph [Formula: see text] is to find a spanning tree [Formula: see text] of [Formula: see text] such that the maximum distance in [Formula: see text] between two adjacent vertices of [Formula:
Publikováno v:
The Journal of the Institute of Image Information and Television Engineers. 58:555-563
A Walsh transformation pair technique is used to analyze the shape features of linear drawings, providing superior shape extraction for angular features. This method employs real number calculations only, but at lower computational cost than previous
Autor:
Eito, Hasegawa, Tsunehito, Higashi, Yasuhiro, Shimada, Yasuharu, Nakanishi, Yuuki, Nakashima, Masatoshi, Takami
Publikováno v:
岡山理科大学紀要. A, 自然科学. 39:71-76