{"created":"2023-05-15T12:35:51.831565+00:00","id":4950,"links":{},"metadata":{"_buckets":{"deposit":"5e90a83d-e9c3-46d9-84df-5afa9c788261"},"_deposit":{"created_by":3,"id":"4950","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"4950"},"status":"published"},"_oai":{"id":"oai:nitech.repo.nii.ac.jp:00004950","sets":["31"]},"author_link":["15566","8926"],"item_10001_biblio_info_28":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2001-05-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicPageEnd":"1208","bibliographicPageStart":"1201","bibliographicVolumeNumber":"E84-A","bibliographic_titles":[{"bibliographic_title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"}]}]},"item_10001_description_36":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"Multi-level divide-and-conquer (MDC) is a generalized divide-and-conquer technique, which consists of more than one division step organized hierarchically. In this paper, we investigate the paradigm of the MDC and show that it is an efficient technique for designing parallel algorithms. The following parallel algorithms are used for studying the MDC: finding the convex hull of discs, finding the upper envelope of line segments, finding the farthest neighbors of a convex polygon and finding all the row maxima of a totally monotone matrix. The third and the fourth algorithms are newly presented. Our discussion is based on the EREW PRAM, but the methods discussed here can be applied to any parallel computation models.","subitem_description_type":"Other"}]},"item_10001_description_38":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_10001_full_name_27":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{}],"names":[{"name":"和田, 幸一"}]}]},"item_10001_publisher_29":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Institute of Electronics, Information and Communication Engineers"}]},"item_10001_source_id_30":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"09168508","subitem_source_identifier_type":"ISSN"}]},"item_10001_source_id_32":{"attribute_name":"書誌レコードID（NCID）","attribute_value_mlt":[{"subitem_source_identifier":"AA10826239","subitem_source_identifier_type":"NCID"}]},"item_10001_version_type_33":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Chen, Wei","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Wada, Koichi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-01-25"}],"displaytype":"detail","filename":"E84-A_1201.pdf","filesize":[{"value":"290.7 kB"}],"format":"application/pdf","license_note":"Copyright (c) 2000 IEICE　http://search.ieice.org/index.html","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"本文_fulltext","url":"https://nitech.repo.nii.ac.jp/record/4950/files/E84-A_1201.pdf"},"version_id":"9111c3e9-d9a4-45c8-ae1c-7e51ded5e424"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Designing Efficient Parallel Algorithms with Multi-Level Divide-and-Conquer","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Designing Efficient Parallel Algorithms with Multi-Level Divide-and-Conquer","subitem_title_language":"en"}]},"item_type_id":"10001","owner":"3","path":["31"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-06-25"},"publish_date":"2013-06-25","publish_status":"0","recid":"4950","relation_version_is_last":true,"title":["Designing Efficient Parallel Algorithms with Multi-Level Divide-and-Conquer"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-05-16T14:41:20.337932+00:00"}