Timeline for Finding largest subset that matches moments
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 10:30 | history | edited | CommunityBot |
Commonmark migration
|
|
| Feb 13, 2014 at 22:55 | answer | added | D.W.♦ | timeline score: 1 | |
| Feb 12, 2014 at 22:33 | comment | added | ht959 | @Pal GD - mean(A) and std(A) are mean and standard deviation. The $\delta$ and $\epsilon$ are not fixed, but I am interested in how the subset size $|C|$ varies with the constraint. Bitwise - I am not interested in the "closest" but rather, "given a tolerance, find the largest subset". Getting the mean i think, is easy; just remove points from the extrema until the means are within $\delta$. | |
| Feb 12, 2014 at 21:33 | comment | added | Bitwise | I suspect (but I may be wrong) that you just want to find a subset whose mean and std are the "closest" to $mean(A)$ and $std(A)$. Is this correct? If so, you should reformulate the problem accordingly. Also, I suggest that you start with just the mean. | |
| Feb 12, 2014 at 16:35 | history | tweeted | twitter.com/#!/StackCompSci/status/433640590052712448 | ||
| Feb 12, 2014 at 12:03 | comment | added | John Kemeny | What are $\text{mean}(A)$ and $\text{std}(A)$ (I assume the mean value and the standard deviation)? Are $\delta$ and $\epsilon$ fixed constants? What happens when you restrict yourself to $A,B \subseteq \mathbb{N}$? | |
| Feb 12, 2014 at 8:40 | comment | added | Raphael | Have you tried expressing your problem as LP? | |
| Feb 12, 2014 at 8:37 | history | edited | Raphael | CC BY-SA 3.0 |
edited tags
|
| Feb 11, 2014 at 23:59 | review | First posts | |||
| Feb 12, 2014 at 0:46 | |||||
| Feb 11, 2014 at 23:42 | history | asked | ht959 | CC BY-SA 3.0 |