Timeline for What is the most ``diverse'' $k$-subset of $[0, 1]^m$?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 27, 2014 at 19:10 | answer | added | Arash Ahadi | timeline score: 0 | |
| Jun 1, 2014 at 20:37 | vote | accept | user109711 | ||
| Jun 1, 2014 at 20:37 | vote | accept | user109711 | ||
| Jun 1, 2014 at 20:37 | |||||
| Jun 1, 2014 at 20:37 | vote | accept | user109711 | ||
| Jun 1, 2014 at 20:37 | |||||
| May 28, 2014 at 22:40 | answer | added | Robert Israel | timeline score: 3 | |
| May 28, 2014 at 16:20 | answer | added | The Masked Avenger | timeline score: 1 | |
| May 28, 2014 at 6:53 | comment | added | Peter Dukes | A general algorithm computing $S$ given $m,k$ may be out of reach. This problem includes the classification of all optimal binary codes as a sub-problem. (I suppose exhaustive search works in that case, but this is presumably not what you're after.) Masked Avenger's comment on volumes can help obtain bounds on the largest minimum distance. | |
| May 28, 2014 at 6:36 | comment | added | user109711 | I don't get your comment at all, may you please detail your idea? | |
| May 27, 2014 at 22:07 | comment | added | The Masked Avenger | Since the spheres tile nicely in small dimensions, you may get good bounds just using volume comparisons. | |
| May 27, 2014 at 22:01 | comment | added | The Masked Avenger | Sounds like you are packing your domain with Manhattan spheres. | |
| May 27, 2014 at 21:14 | history | asked | user109711 | CC BY-SA 3.0 |