Zobrazeno 1 - 10
of 1 218
pro vyhledávání: '"Karloff, H."'
There are two main algorithmic approaches to sparse signal recovery: geometric and combinatorial. The geometric approach starts with a geometric constraint on the measurement matrix and then uses linear programming to decode information about the sig
Externí odkaz:
http://arxiv.org/abs/0804.4666
Autor:
Farhadi, Majid1 (AUTHOR), Gupta, Swati2 (AUTHOR) swatig@mit.edu, Sun, Shengding1 (AUTHOR), Tetali, Prasad3 (AUTHOR), Wigal, Michael C.1 (AUTHOR)
Publikováno v:
Mathematical Programming. Nov2024, Vol. 208 Issue 1/2, p277-318. 42p.
Publikováno v:
Scopus-Elsevier
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Autor:
Cecchetto, Federica1 (AUTHOR) federica.cecchetto@ifor.math.ethz.ch, Traub, Vera2 (AUTHOR), Zenklusen, Rico1 (AUTHOR)
Publikováno v:
Mathematical Programming. Sep2024, Vol. 207 Issue 1/2, p515-549. 35p.
Publikováno v:
Scopus-Elsevier
We consider a geometric model for the problem of minimizing access control lists (ACLs) in network routers, a model that also has applications to rectilinear picture compression and figure drawing in common graphics software packages. Here the goal i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c0ddb0038b5f6b1cdcdc8a297ce4fc76
https://resolver.caltech.edu/CaltechAUTHORS:20190110-140236006
https://resolver.caltech.edu/CaltechAUTHORS:20190110-140236006
Autor:
Chen, Zhihan1 (AUTHOR) gege20200202@163.com, Wei, Lulin1 (AUTHOR) wl1987338937wl@gmail.com, Ma, Hongan2 (AUTHOR) mahongan_sy@163.com, Liu, Yang3 (AUTHOR) yang_liu2018@163.com, Yue, Meng4 (AUTHOR) ytuym527@163.com, Shi, Junrui5 (AUTHOR) shijunrui2002@163.com
Publikováno v:
Energies (19961073). May2024, Vol. 17 Issue 9, p2072. 16p.
Publikováno v:
In Operations Research Letters 2008 36(4):399-401
Publikováno v:
50th Annual IEEE Symposium on Foundations of Computer Science, 2009. FOCS '09; 2009, p427-436, 10p
Publikováno v:
45th Annual IEEE Symposium on Foundations of Computer Science; 2004, p101-107, 7p
Publikováno v:
Proceedings 17th IEEE Annual Conference on Computational Complexity; 2002, p143-151, 9p