{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T07:10:08Z","timestamp":1751094608121,"version":"3.41.0"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,5,25]],"date-time":"2025-05-25T00:00:00Z","timestamp":1748131200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,25]],"date-time":"2025-05-25T00:00:00Z","timestamp":1748131200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,5,25]]},"DOI":"10.1109\/iscas56072.2025.11044080","type":"proceedings-article","created":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T17:42:19Z","timestamp":1751046139000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["MATSORT: Fast and Efficient Approximate Matrix Sorting Algorithm for DNN Applications"],"prefix":"10.1109","author":[{"given":"Xuanhao","family":"Lu","sequence":"first","affiliation":[{"name":"University of Toronto,Department of Electrical and Computer Engineering,Toronto,Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alireza","family":"Ahrar","sequence":"additional","affiliation":[{"name":"York University,Department of Electrical Engineering and Computer Science,Toronto,Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mostafa Rahimi","family":"Azghadi","sequence":"additional","affiliation":[{"name":"James Cook University,College of Science and Engineering,Townsville,Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Genov","sequence":"additional","affiliation":[{"name":"University of Toronto,Department of Electrical and Computer Engineering,Toronto,Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amirali","family":"Amirsoleimani","sequence":"additional","affiliation":[{"name":"York University,Department of Electrical Engineering and Computer Science,Toronto,Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Sparks of artificial general intelligence: Early experiments with gpt-4","year":"2023","author":"Bubeck","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICECA52323.2021.9675934"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCE-Taiwan58799.2023.10226787"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS58744.2024.10557986"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00015"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/aisy.202000115"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/mc.1982.1653825"},{"key":"ref8","article-title":"Imagenet classification with deep convolutional neural networks","volume-title":"Advances in Neural Information Processing Systems","volume":"25","author":"Krizhevsky","year":"2012"},{"article-title":"Flex-tpu: A flexible tpu with runtime reconfigurable dataflow architecture","year":"2024","author":"Elbtity","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3129647"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3012212"},{"key":"ref12","article-title":"Optimal brain damage","volume-title":"Advances in Neural Information Processing Systems","volume":"2","author":"LeCun","year":"1989"},{"key":"ref13","article-title":"Runtime neural pruning","volume-title":"Advances in Neural Information Processing Systems","volume":"30","author":"Lin","year":"2017"},{"key":"ref14","first-page":"6377","article-title":"Pruning neural networks without any data by iteratively conserving synaptic flow","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"Tanaka","year":"2020"},{"article-title":"Accurate neural network pruning requires rethinking sparse optimization","year":"2023","author":"Kuznedelev","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2022.3178047"},{"article-title":"Packing sparse convolutional neural networks for efficient systolic array implementations: Column combining under joint optimization","year":"2018","author":"Kung","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3392717.3392751"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA56546.2023.10070977"}],"event":{"name":"2025 IEEE International Symposium on Circuits and Systems (ISCAS)","start":{"date-parts":[[2025,5,25]]},"location":"London, United Kingdom","end":{"date-parts":[[2025,5,28]]}},"container-title":["2025 IEEE International Symposium on Circuits and Systems (ISCAS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11043142\/11042930\/11044080.pdf?arnumber=11044080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T06:39:16Z","timestamp":1751092756000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11044080\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,25]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/iscas56072.2025.11044080","relation":{},"subject":[],"published":{"date-parts":[[2025,5,25]]}}}