Quantum redactiones paginae "Functio Babel" differant
Content deleted Content added
m + ex en: |
|||
Linea 8: | Linea 8: | ||
<ref>[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.84.5256&rep=rep1&type=pdf Joel A. Tropp, "Greed Is Good: Algorithmic Results for Sparse Approximation,"] apud siteseerx.ist.psu.edu.</ref> |
<ref>[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.84.5256&rep=rep1&type=pdf Joel A. Tropp, "Greed Is Good: Algorithmic Results for Sparse Approximation,"] apud siteseerx.ist.psu.edu.</ref> |
||
<ref>[http://www.yaroslavvb.com/papers/tropp-just.pdf "Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise," ''IEEE Transactions on Information Theory'' (2004),] apud yaroslavvb.com.</ref> |
<ref>[http://www.yaroslavvb.com/papers/tropp-just.pdf "Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise," ''IEEE Transactions on Information Theory'' (2004),] apud yaroslavvb.com.</ref> |
||
==Casus peculiaris== |
|||
Cum p=1, functio babel est [[cohaerentia mutua]]. |
|||
==Notae== |
==Notae== |
Emendatio ex 11:54, 16 Maii 2015
Nulla Vicipaediae Latinae pagina huc annectitur. |
Functio Babel, etiam cohaerentia cumulata appellata, maximam in quolibet dictionario cohaerentiam inter atomum fixum et congeriem aliorum atomorum metitur.
Definitio et formula
Functio Babel dictionarii cum columnis aequabilibus est functio aestimationis verae quae definitur
ubi sunt columnae (atomi) dictionarii [1] [2]
Casus peculiaris
Cum p=1, functio babel est cohaerentia mutua.
Notae
- ↑ Joel A. Tropp, "Greed Is Good: Algorithmic Results for Sparse Approximation," apud siteseerx.ist.psu.edu.
- ↑ "Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise," IEEE Transactions on Information Theory (2004), apud yaroslavvb.com.