Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Tran, Trac Duy"'
Finding the most sparse solution to the underdetermined system $\mathbf{y}=\mathbf{Ax}$, given a tolerance, is known to be NP-hard. A popular way to approximate a sparse solution is by using Greedy Pursuit algorithms, and Orthogonal Matching Pursuit
Externí odkaz:
http://arxiv.org/abs/2407.06434
Autor:
Tran, Trac Duy.
Thesis (Ph. D.)--University of Wisconsin--Madison, 1998.
Typescript. Description based on print version record. Includes bibliographical references (leaves 183-191).
Typescript. Description based on print version record. Includes bibliographical references (leaves 183-191).
Externí odkaz:
http://catalog.hathitrust.org/api/volumes/oclc/40952840.html
Autor:
Tran, Trac Duy
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
Includes bibliographical references (leaves 95-97).
by Trac Duy Tran.
M.S.
Includes bibliographical references (leaves 95-97).
by Trac Duy Tran.
M.S.
Externí odkaz:
http://hdl.handle.net/1721.1/34077
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Tran, Trac Duy, Nguyen, Truong Q.
Publikováno v:
IEEE Transactions on Signal Processing. Sep97, Vol. 45 Issue 9, p2175. 13p. 6 Black and White Photographs, 6 Diagrams, 2 Charts, 2 Graphs.
Autor:
Zhang, Jie, Duncan, Kerron, Suo, Yuanming, Xiong, Tao, Mitra, Srinjoy, Tran, Trac Duy, Etienne-Cummings, Ralph
Publikováno v:
IEEE Transactions on Circuits & Systems. Part I: Regular Papers; May2016, Vol. 63 Issue 5, p599-608, 10p