{"updated":"2025-01-23T00:26:35.910960+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00015252","sets":["581:833:842"]},"path":["842"],"owner":"1","recid":"15252","title":["点集合の重み付きミニマックス線形近似問題に対するアルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"1989-04-15"},"_buckets":{"deposit":"0a4f778b-0236-4e41-a0fc-9fd4c24fa607"},"_deposit":{"id":"15252","pid":{"type":"depid","value":"15252","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"点集合の重み付きミニマックス線形近似問題に対するアルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"点集合の重み付きミニマックス線形近似問題に対するアルゴリズム"},{"subitem_title":"An Algorithm for Weighted Minimax Linear Approximation of Points","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ショートノート","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"1989-04-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州工業大学情報科学センター"},{"subitem_text_value":"九州大学工学部情報工学科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Information Science Center, Kyushu Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science and Communication Engineering, Kyushu University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/15252/files/IPSJ-JNL3004018.pdf"},"date":[{"dateType":"Available","dateValue":"1991-04-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL3004018.pdf","filesize":[{"value":"207.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"eae9799a-73dd-4de9-9fdb-2c984dffa6a0","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1989 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"今井, 桂子"},{"creatorName":"今井, 浩"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Keiko, Imai","creatorNameLang":"en"},{"creatorName":"Hiroshi, Imai","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"d次元空間でのn点の重み付きミニマックス線形近似問題が アルゴリズム的には d+1次元での2n点の凸包を求めるという計算幾何学での最も基本的な問題に帰着できることを示す.これより d=2の平面の場合には 問題がO(n log n)の最適の手間で解けることがわかる.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"546","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"544","bibliographicIssueDates":{"bibliographicIssueDate":"1989-04-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"30"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:48:51.206489+00:00","id":15252,"links":{}}