Timeline for Finding the most compact representation of a vector in an "overdetermined base"
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 26, 2013 at 22:27 | history | edited | Ricardo Andrade |
replaced tags
|
|
| Aug 26, 2013 at 19:19 | history | edited | Hernan | CC BY-SA 3.0 |
deleted 893 characters in body
|
| Aug 24, 2013 at 0:18 | history | edited | Hernan | CC BY-SA 3.0 |
Added problem found while applying this allgorithm
|
| Aug 22, 2013 at 15:15 | vote | accept | Hernan | ||
| Aug 22, 2013 at 15:10 | comment | added | Hernan | @VedranŠego: You are right. I miss typed. Thanks | |
| Aug 22, 2013 at 15:09 | history | edited | Hernan | CC BY-SA 3.0 |
fixed
|
| Aug 22, 2013 at 14:07 | answer | added | Noah Stein | timeline score: 3 | |
| Aug 22, 2013 at 14:02 | comment | added | Vedran Šego |
Shouldn't it be 0 0 0 1 2? How do you define "the most compact"? Only in terms of the number of (non)zero elements, or is there something else as well?
|
|
| Aug 22, 2013 at 13:54 | review | First posts | |||
| Aug 22, 2013 at 14:50 | |||||
| Aug 22, 2013 at 13:38 | history | asked | Hernan | CC BY-SA 3.0 |