Timeline for Pure greedy algorithm
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 4, 2012 at 23:00 | comment | added | Studentmath | $G_m(f,D)$ is approximant we obtained after $m$ th step of PGA. For more information see mosaic.math.tamu.edu/~rdevore/publications/91.pdf | |
| Nov 4, 2012 at 15:27 | comment | added | Nikita Sidorov | What's $G_m(f,D)$? | |
| Nov 4, 2012 at 14:54 | history | edited | Studentmath | CC BY-SA 3.0 |
added 11 characters in body
|
| Nov 4, 2012 at 14:44 | history | edited | Studentmath | CC BY-SA 3.0 |
added 310 characters in body
|
| Nov 4, 2012 at 12:31 | history | edited | Studentmath | CC BY-SA 3.0 |
deleted 1 characters in body; deleted 232 characters in body
|
| Nov 4, 2012 at 12:25 | history | asked | Studentmath | CC BY-SA 3.0 |