{"id":"https://openalex.org/W2413305421","doi":"https://doi.org/10.1007/978-3-642-04648-3_16","title":"Near-Optimal Multi-user Greedy Bit-Loading for Digital Subscriber Lines","display_name":"Near-Optimal Multi-user Greedy Bit-Loading for Digital Subscriber Lines","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2413305421","doi":"https://doi.org/10.1007/978-3-642-04648-3_16","mag":"2413305421"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-04648-3_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-04648-3_16","pdf_url":null,"source":{"id":"https://openalex.org/S4393917809","display_name":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","issn_l":"1867-8211","issn":["1867-8211","1867-822X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108292383","display_name":"Alastair McKinley","orcid":null},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Alastair McKinley","raw_affiliation_strings":["Queens University Belfast, Belfast, BT7 1NN, Northern Ireland, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Queens University Belfast, Belfast, BT7 1NN, Northern Ireland, United Kingdom","institution_ids":["https://openalex.org/I126231945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081759293","display_name":"Alan Marshall","orcid":"https://orcid.org/0000-0002-8058-5242"},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alan Marshall","raw_affiliation_strings":["Queens University Belfast, Belfast, BT7 1NN, Northern Ireland, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Queens University Belfast, Belfast, BT7 1NN, Northern Ireland, United Kingdom","institution_ids":["https://openalex.org/I126231945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108292383"],"corresponding_institution_ids":["https://openalex.org/I126231945"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29209072,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"224","last_page":"239"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12146","display_name":"Power Line Communications and Noise","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12146","display_name":"Power Line Communications and Noise","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11444","display_name":"Electromagnetic Compatibility and Noise Suppression","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11873","display_name":"PAPR reduction in OFDM","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/digital-subscriber-line","display_name":"Digital subscriber line","score":0.966140866279602},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6932620406150818},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6727657914161682},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46391597390174866},{"id":"https://openalex.org/keywords/crosstalk","display_name":"Crosstalk","score":0.44550788402557373},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.43995529413223267},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42726930975914},{"id":"https://openalex.org/keywords/electronic-engineering","display_name":"Electronic engineering","score":0.18132251501083374},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.15405207872390747},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.15250372886657715},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1360267996788025},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08426713943481445}],"concepts":[{"id":"https://openalex.org/C201374245","wikidata":"https://www.wikidata.org/wiki/Q104534","display_name":"Digital subscriber line","level":2,"score":0.966140866279602},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6932620406150818},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6727657914161682},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46391597390174866},{"id":"https://openalex.org/C169822122","wikidata":"https://www.wikidata.org/wiki/Q230187","display_name":"Crosstalk","level":2,"score":0.44550788402557373},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.43995529413223267},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42726930975914},{"id":"https://openalex.org/C24326235","wikidata":"https://www.wikidata.org/wiki/Q126095","display_name":"Electronic engineering","level":1,"score":0.18132251501083374},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.15405207872390747},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.15250372886657715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1360267996788025},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08426713943481445}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-04648-3_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-04648-3_16","pdf_url":null,"source":{"id":"https://openalex.org/S4393917809","display_name":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","issn_l":"1867-8211","issn":["1867-8211","1867-822X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","raw_type":"book-chapter"},{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/7f36e5a5-fc66-49e1-9057-810c68046e8c","is_oa":false,"landing_page_url":"https://pure.qub.ac.uk/en/publications/7f36e5a5-fc66-49e1-9057-810c68046e8c","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"McKinley, A & Marshall, A 2008, 'Near-Optimal Multi-User Greedy Bit-Loading for Digital Subscriber Lines', Paper presented at Third International Conference on Access Networks 2008, AccessNets \u201908, Las Vegas, United States, 01/10/2008 - 01/10/2008 pp. 224-238.","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1508899218","https://openalex.org/W1537960262","https://openalex.org/W1975661967","https://openalex.org/W2000578751","https://openalex.org/W2033995951","https://openalex.org/W2056107761","https://openalex.org/W2096017053","https://openalex.org/W2103262619","https://openalex.org/W2111826154","https://openalex.org/W2124409123","https://openalex.org/W2126240264","https://openalex.org/W2130156169","https://openalex.org/W2141631581","https://openalex.org/W2151398973","https://openalex.org/W2151771064","https://openalex.org/W2165849651","https://openalex.org/W2170898774","https://openalex.org/W4233685539","https://openalex.org/W4253000952"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W1531601525","https://openalex.org/W2119590320","https://openalex.org/W1827895227","https://openalex.org/W4285104409","https://openalex.org/W2389640906","https://openalex.org/W4312077400","https://openalex.org/W4210317843"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}