Timeline for Generate a set of pairs
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 22, 2015 at 17:32 | history | tweeted | twitter.com/StackMma/status/668482142498856960 | ||
| Nov 22, 2015 at 6:36 | answer | added | ubpdqn | timeline score: 4 | |
| Nov 22, 2015 at 6:03 | history | edited | march | edited tags | |
| Nov 22, 2015 at 6:01 | answer | added | march | timeline score: 5 | |
| Nov 22, 2015 at 5:25 | comment | added | Suro | In case the point is uniformly, could you please help me to write an appropriate code | |
| Nov 22, 2015 at 5:14 | comment | added | march | I'm sorry, I don't understand your comment. You could just choose a point uniformly (if that's the distribution from which you're pulling, which I assume) in the region specified be your inequality and check whether or not it satisfies fun[x,z] >0. If so, keep it. If not, throw it out. This is called rejection sampling (or the accept-reject Monte Carlo algorithm). | |
| Nov 22, 2015 at 5:13 | comment | added | Suro | No, it can be random either. | |
| Nov 22, 2015 at 5:11 | comment | added | march | And do you want to choose these pairs uniformly in the relevant region? | |
| Nov 22, 2015 at 5:04 | history | asked | Suro | CC BY-SA 3.0 |