Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with performance-tuning
Search options not deleted
user 59612
Questions on optimizing Mathematica code for higher performance. This may mean faster execution, lower memory usage or both. Not to be confused with mathematical optimization.
8
votes
3
answers
224
views
Find positions of certain value in a big boolean list
I would like to know is it possible to find positions of False in t:
t = Table[RandomChoice[{True, False}], 6000];
Flatten[Position[t, False]] // AbsoluteTiming
faster than the above method.
I will …
- 428
4
votes
2
answers
363
views
Efficient implementation of Non-Maximum Suppression
I would like to know is there is a way to do this:
oneInter[{keep_, rest_, threshold_}] :=
Module[{rest1, keep1},
keep1 = Prepend[keep, rest[[1]]];
rest1 = Delete[rest, 1];
{keep1,
…
- 428