When and by how much can helper node selection improve regenerating codes?
ناشر:
سال
: 2014شناسه الکترونیک: 10.1109/CVPR.2014.41
کلیدواژه(گان): Clustering algorithms,n Computer vision,n Convergence,n Eigenvalues and eigenfunctions,n Matrix decomposition,n Optimization,n Robustness
کالکشن
:
-
آمار بازدید
When and by how much can helper node selection improve regenerating codes?
Show full item record
| contributor author | Ahmad, Imad | |
| contributor author | Wang, Chih-Chun | |
| date accessioned | 2020-03-12T22:53:41Z | |
| date available | 2020-03-12T22:53:41Z | |
| date issued | 2014 | |
| identifier other | 7028491.pdf | |
| identifier uri | http://libsearch.um.ac.ir:80/fum/handle/fum/1098268 | |
| format | general | |
| language | English | |
| publisher | IEEE | |
| title | When and by how much can helper node selection improve regenerating codes? | |
| type | Conference Paper | |
| contenttype | Metadata Only | |
| identifier padid | 8239409 | |
| subject keywords | Clustering algorithms | |
| subject keywords | n Computer vision | |
| subject keywords | n Convergence | |
| subject keywords | n Eigenvalues and eigenfunctions | |
| subject keywords | n Matrix decomposition | |
| subject keywords | n Optimization | |
| subject keywords | n Robustness | |
| identifier doi | 10.1109/CVPR.2014.41 | |
| journal title | ommunication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on | |
| filesize | 599226 | |
| citations | 0 |