Forum Replies Created

Viewing 7 posts - 1 through 7 (of 7 total)
  • Author
    Posts
  • mermerico
    Moderator
    Post count: 10

    Awesome! Unfortunately I’m not in the income bracket to qualify as an accredited investor, but I’d definitely be interested in crowdfunding when the benchmarks come out.

  • mermerico
    Moderator
    Post count: 10

    For some reason I had the impression that this talk was recorded. Was it?

  • mermerico
    Moderator
    Post count: 10

    I agree. Whenever I see one of those alternative options, I think the company is after my data. The best thing to do is to make the registration process as painless as possible. Reddit gets it right in this regard. Is it possible to integrate setting the password and using a captcha on the original registration page?

  • mermerico
    Moderator
    Post count: 10
    in reply to: First Thread! #191

    Is there a way to make the forums (and maybe even the whole website) wider?

  • mermerico
    Moderator
    Post count: 10

    Streamers are mentioned in a couple places on the site, but I don’t remember seeing them in the talks. Have they been filed?

  • mermerico
    Moderator
    Post count: 10
    in reply to: Metadata #625

    I’m not sure that’s exactly what we want. To get maximum performance, we should probably use this algorithm: Naive algorithm taken from Nvidia GPU Gems

    1: for d = 1 to log2 n do
    2:     for all k in parallel do
    3:          if k >= 2^d  then
    4:              x[k] = x[k – 2^(d-1)] + x[k]
    (from NVIDIA'as GPU Gems page)
    

    Alternate would be useful for d = 3, but the other steps require a shuffle.

    By the way, I would be personally excited for faster cumulative sum because it is useful for implementing fast gaussian blurs.

    • This reply was modified 10 years, 4 months ago by  mermerico.
    • This reply was modified 10 years, 4 months ago by  mermerico.
  • mermerico
    Moderator
    Post count: 10
    in reply to: Metadata #581

    You can indeed do a cumulative sum of N elements with log(N) sums of vectors of length N/2. The problem is all the reshuffling, storing, retrieving and duplicating of intermediate values that you have to do to get there. For small vectors like the ones we are talking about, there is probably little to no advantage over the naive method.

Viewing 7 posts - 1 through 7 (of 7 total)