Reputation
15,232
Next privilege 20,000 Rep.
Access 'trusted user' tools
Badges
1 38 78
Newest
 Enlightened
Impact
~179k people reached

Dec
4
revised How do you pattern match a DataDistribution
added 2 characters in body
Dec
4
revised How do you pattern match a DataDistribution
added 286 characters in body
Dec
4
answered How do you pattern match a DataDistribution
Dec
4
answered Forest plot with Mathematica 9
Dec
2
awarded  Necromancer
Dec
2
awarded  Revival
Dec
2
comment Representative Smooth Kernel Distribution from Truncated Distribution
I'm glad. You might want to use the estimate on the original data to get a better automatic bandwidth (so it isn't based on the pseudo-data). This can be done by SmoothKernelDistribution[data]["Bandwidth"].
Dec
2
revised Representative Smooth Kernel Distribution from Truncated Distribution
added 505 characters in body
Dec
2
revised Representative Smooth Kernel Distribution from Truncated Distribution
deleted 61 characters in body
Dec
2
answered Representative Smooth Kernel Distribution from Truncated Distribution
Dec
2
answered Make a density list plot/histogram from large, pre-binned data set?
Nov
30
accepted How can I use the overhang argument to Partition to avoid using PadLeft and PadRight here?
Nov
30
asked How can I use the overhang argument to Partition to avoid using PadLeft and PadRight here?
Nov
30
comment Computing closest set of points to each point in large set — running out of memory (arrays unpacking)
I don't have M available at the moment. It might be helpful to use On["Packing"] to determine exactly where the unpacking is occurring as a start.
Nov
30
answered Quickly display a color graphically
Nov
29
comment Installing CRAN Packages
I'm running Windows 7 64-bit and this works just fine. Perhaps a it is platform dependent or some limitation in a trial version of M?
Nov
29
comment EstimatedProcess hangs with documentation example
Takes about 11 seconds on my machine (Win 7 64-bit 8GB RAM)
Nov
28
awarded  Talkative
Nov
27
answered Replacing functions
Nov
25
comment Performance of a Do-Loop of variable length
Probably, but I suspect that doing so is going to be slower than computing them up front (though perhaps less memory intensive). Keep in mind that they aren't persistent since they are defined in a Block so sometime after the Block exits they are cleaned up by the garbage collector.