Reputation
625
Top tag
Next privilege 1,000 Rep.
See votes, expandable usercard
Badges
4 20
Newest
 Yearling
Impact
~10k people reached

  • 0 posts edited
  • 1 helpful flag
  • 161 votes cast
Dec
31
accepted How to generalize the planar case of the closest pair problem to d dimensions?
Dec
31
revised How to generalize the planar case of the closest pair problem to d dimensions?
deleted 1949 characters in body
Dec
30
revised How to generalize the planar case of the closest pair problem to d dimensions?
added 9 characters in body
Dec
30
comment How to generalize the planar case of the closest pair problem to d dimensions?
I see. I know that I have to do c * n operations but when I implement it I have to know how many points should I scan for each p point within the δ distance of the median l line in d dimensions. I know that it is 6 for 2 dimensions but how do I know how much c is for d dimensions?
Dec
29
comment How to generalize the planar case of the closest pair problem to d dimensions?
So what you are trying to say is that basically I only need to change this part: "One simply has to replace 6 * n distance calculations by c * n distance calculations, where c is the maximum number of points which fit into a d-dimensional box of size (dist, 2*dist, 2*dist, ..., 2*dist), when the shortest distance between the points is dist at minimum."?
Dec
29
awarded  Yearling
Dec
29
asked How to generalize the planar case of the closest pair problem to d dimensions?
Nov
25
comment What is the purpose of wrapped values in Haskell?
I've read up on Higher Kinded Types. So basically using them I can get rid of the excessive call to isPresent for example since the use case of Nothing is already handled in the typeclass definition which can be in fact a monad?
Nov
24
accepted What is the purpose of wrapped values in Haskell?
Nov
24
comment What is the purpose of wrapped values in Haskell?
I think I get what you are trying to say. So the difference to say a java decorator is that this is a more abstract decorator where I get an Object and I can do whatever I want with that Object which can be even a FunctionalInterface or such.
Nov
24
comment What is the purpose of wrapped values in Haskell?
So what is the difference between a monad and a decorator then?
Nov
24
comment What is the purpose of wrapped values in Haskell?
What you describe has some resemblance to python decorators or the decorator pattern in java but this seems more elegant to me since the Nothing is implicitly checked and no boilerplate is needed. Right?
Nov
24
asked What is the purpose of wrapped values in Haskell?
Oct
4
awarded  Popular Question
Aug
11
comment When is it justifiable to use pair programming and when is it not?
This is not a duplicate as @Jules pointed out. Voting to reopen.
Aug
11
comment How can you achieve and maintain flow while pair programming?
-1 this does not answer the question.
Aug
11
asked When is it justifiable to use pair programming and when is it not?
Jun
12
awarded  Popular Question
Jun
10
awarded  Popular Question
Jun
24
asked Hot swap/plug components in clojure?