Reputation
64,609
Next tag badge:
179/100 score
19/20 answers
Badges
19 179 311
Newest
 Nice Answer
Impact
~856k people reached

2d
awarded  Nice Answer
Apr
14
comment Does RunProcess work on Chinese Windows?
maybe it's confusing it with DueProcess which would explain the $Failed (runs away)
Apr
6
comment How to make the computer consider two numbers equal up to a certain precision
@rasher Moderators cannot change votes. You can make a dummy edit, reverse your vote and then undo the edit within the minute. (there will be a note in the history that you edited the post, but the contents will remain the same)
Mar
21
awarded  Nice Answer
Mar
14
comment Performing analysis of data extracted from an SQL database
If out is your expression w/o TableForm, then Evaluate[Symbol /@ First@out] = Transpose@Rest@out should work. This doesn't have anything to do with SQL queries though...
Mar
14
comment How to make a notebook that will be window maximized when open?
I think you accidentally posted the same answer in two places
Mar
11
comment How to implement the dual Lagrange?
It's open now @SjoerdC.deVries
Mar
9
comment Simulation of the semicircle Wigner Theorem
What is your question?
Mar
8
comment Is Daylight Savings Time accounted for when using AbsoluteTime[]?
This is the first thing mentioned in the documentation — "AbsoluteTime[] uses whatever date and time have been set on your computer system. It performs no corrections for time zones, daylight saving time, etc. "
Mar
8
awarded  Nice Answer
Mar
6
comment Two identical functions give different answers
This should probably just be a comment...
Feb
28
comment Diagonal minors of matrix
"Since I am going to calculate the minors of big matrices and I only need to know the diagonal elements, is there a way just to calculate the diagonal elements in minor matrix?" — Surely, performance is an issue here.
Feb
10
awarded  Nice Answer
Feb
10
awarded  Necromancer
Feb
10
comment Convex optimization
@DanielLichtblau The remark included the clause following it — "and enforce sparsity". NMinimize handles $\ell_1$ minimization fine. In compressive sensing/sparse theory, one wishes to solve an $\ell_0$ minimization problem, but because that is NP-hard, you do $\ell_p,\ 0<p\le 1$ minimization under certain assumptions/conditions and with other possibly non-linear constraints. I guess my phrasing wasn't the best way to put it but nothing better comes to mind now... will update it if I think of something better.
Feb
8
awarded  Revival
Feb
8
comment Convex optimization
@rhermans I missed your 200 bounty (was on vacation) but I hope the answer is helpful :)
Feb
8
comment Convex optimization
@rhermans I missed your 200 bounty (was on vacation) but I hope the answer is helpful :)
Feb
8
answered Convex optimization
Feb
7
awarded  Good Answer