58,609 reputation
18148273
bio website
location
age
visits member for 2 years, 3 months
seen 1 hour ago

Mar
23
revised Why does this pattern for combining two lists require triple underscores (___) to work?
added 26 characters in body; edited tags
Mar
23
revised Fastest way to calculate matrix of pairwise distances
deleted 147 characters in body
Mar
23
revised Fastest way to calculate matrix of pairwise distances
deleted 147 characters in body
Mar
22
revised Why are there two separate MathKernel processes running when I start up Mathematica 9?
added 34 characters in body
Mar
22
reviewed Close How can I format Mathematica expressions for $\LaTeX$ without manual intervention?
Mar
22
comment Fastest way to calculate matrix of pairwise distances
Seeing as I goofed up the dimensions, I pulled out an old MATLAB code of mine for a vectorized solution to aim for speed (I had forgotten what I had done) and it was more or less identical to this :)
Mar
22
answered Fastest way to calculate matrix of pairwise distances
Mar
22
comment How to extract the bin width from a Histogram made with an automatic binning method?
Please see the edit to my answer for a version 7 solution.
Mar
22
revised How to extract the bin width from a Histogram made with an automatic binning method?
added 624 characters in body
Mar
22
reviewed Edit suggested edit on How to extract the bin width from a Histogram made with an automatic binning method?
Mar
22
revised How to extract the bin width from a Histogram made with an automatic binning method?
deleted 91 characters in body; edited tags
Mar
22
revised Simplifying a trigonometric equation to obtain specific terms
added 23 characters in body; edited tags; edited title
Mar
22
answered How to extract the bin width from a Histogram made with an automatic binning method?
Mar
22
comment Graphical representation of a moving sound source
Ah yes, those are highly directional, so interpreting the lag is a lot more complicated and will also need to take into consideration the room geometry...
Mar
22
comment Efficiently finding the positions of a large list of targets in another, even larger list
Since you know the number of elements in your list (60k) and its sublist structure (3 elements), why don't you just pick the positions at random from a list of possible positions, instead of picking the elements and then using Position (which is very slow)? It's the same and should be very fast. Even if you need to construct smallList, you can use these randomly generated positions and extract the elements using Part, which would still be faster. Also, your pure function construction in Map is incorrect...
Mar
22
revised Is there a callback for notebook exit?
added 2 characters in body; edited title
Mar
22
answered Is there a callback for notebook exit?
Mar
21
comment Faster way to convert triangle list to edge list with no duplicates
This is exactly what I did too :) Mine's twice as fast as Szabolcs's. Re: sorting, what I did was to sort the integers in each triangle list and ensure that the indexing did not change the ordering, which means that the last indexing element becomes {1,3}
Mar
21
answered Faster way to convert triangle list to edge list with no duplicates
Mar
21
comment How can I change a Slider's appearance?
@IstvánZachar Yeah, I don't think you can trust them. It seems to have been sloppily implemented... For instance, the simplest gauge: HorizontalGauge[50, {0, 100}] supposedly has AxesStyle -> {None, None}, but try entering that as an explicit option and it complains.