An Algorithm for Finding the Complexity Visible Region from an Area

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 340
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorYoo, KH-
dc.contributor.authorKim , DS-
dc.contributor.authorShin, Sung-Yong-
dc.contributor.authorChwa, Kyung Yong-
dc.date.accessioned2013-03-14T08:42:45Z-
dc.date.available2013-03-14T08:42:45Z-
dc.date.created2012-02-06-
dc.date.issued1994-
dc.identifier.citationProc. KISS Annual Conference, v., no., pp.807 - 810-
dc.identifier.urihttp://hdl.handle.net/10203/107114-
dc.languageKOR-
dc.titleAn Algorithm for Finding the Complexity Visible Region from an Area-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage807-
dc.citation.endingpage810-
dc.citation.publicationnameProc. KISS Annual Conference-
dc.identifier.conferencecountrySouth Korea-
dc.identifier.conferencecountrySouth Korea-
dc.contributor.localauthorShin, Sung-Yong-
dc.contributor.localauthorChwa, Kyung Yong-
dc.contributor.nonIdAuthorYoo, KH-
dc.contributor.nonIdAuthorKim , DS-
Appears in Collection
CS-Conference Papers(학술회의논문)CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0