직선상에서 최대구간을 찾는 최적 알고리즘An Optimal Algorithm for Finding the Maximum Interval in R¹

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 483
  • Download : 0
DC FieldValueLanguage
dc.contributor.author허성우-
dc.contributor.author좌경룡-
dc.contributor.author신성용-
dc.date.accessioned2013-03-14T10:26:17Z-
dc.date.available2013-03-14T10:26:17Z-
dc.date.created2012-02-06-
dc.date.issued1988-
dc.identifier.citationKISS Annual Conference, v.15, no.2, pp.491 - 494-
dc.identifier.urihttp://hdl.handle.net/10203/107774-
dc.languageKOR-
dc.publisher한국정보과학회-
dc.title직선상에서 최대구간을 찾는 최적 알고리즘-
dc.title.alternativeAn Optimal Algorithm for Finding the Maximum Interval in R¹-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.volume15-
dc.citation.issue2-
dc.citation.beginningpage491-
dc.citation.endingpage494-
dc.citation.publicationnameKISS Annual Conference-
dc.identifier.conferencecountrySouth Korea-
dc.identifier.conferencecountrySouth Korea-
dc.contributor.localauthor좌경룡-
dc.contributor.localauthor신성용-
dc.contributor.nonIdAuthor허성우-
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