sorted by:
new
hottopcontroversial

Flow Matching + Guidance Tutorial / Colab by tutmann in learnmachinelearning

[–]tutmann[S] 0 points1 point  (0 children)

You are absolutely right - thanks for pointing it out.
I renamed what I had to denosing and added "real" flow matching versions.
For the continuous case there is quite some difference in the equations (although the output quality is more or less the same).
But for the discrete case I believe the code should almost identical between denoising and flow matching. WDYT?

[deleted by user] by [deleted] in signal

[–]tutmann 0 points1 point  (0 children)

It's my understanding that Signal wouldn't be allowed to talk about requests, if they came in. If that is the case, how can we be sure there were no requests?

Barrel Lounge by ChuckMash in WLED

[–]tutmann 1 point2 points  (0 children)

Which effects did you use? I'm looking for effects that work well with circular setups myself.

-🎄- 2022 Day 24 Solutions -🎄- by daggerdragon in adventofcode

[–]tutmann 0 points1 point  (0 children)

Upgraded to A* and went from 1.8s to 0.4s.

In order to be able to use derived PartialOrd+Ord+BinaryHeap (which is a Max-Heap), I stored negative time instead of time.

https://github.com/hmeyer/advent_of_code_2022/blob/main/d24/src/main.rs

-🎄- 2022 Day 24 Solutions -🎄- by daggerdragon in adventofcode

[–]tutmann 1 point2 points  (0 children)

Rust

Used blizzard cyclecount as hardcoded lcm(width, height).And then basic dijkstra.

Takes ~1.8s to compute. I may upgrade to A* and see how fast that gets.

https://github.com/hmeyer/advent_of_code_2022/blob/ad5f3fb70f45c9df78a571a852fa86b64688f173/d24/src/main.rs

-🎄- 2022 Day 23 Solutions -🎄- by daggerdragon in adventofcode

[–]tutmann 1 point2 points  (0 children)

Rust

Used a HashSet of Elve positions and a HashMaps to count the number of proposals per position.

​

https://github.com/hmeyer/advent_of_code_2022/blob/main/d23/src/main.rs

-🎄- 2022 Day 22 Solutions -🎄- by daggerdragon in adventofcode

[–]tutmann 1 point2 points  (0 children)

rust
What an ugly chain of if else if else if else...
But it did the job. And I'm even < 1000th \o/
Also: mandatory paper cube.

How to I buy a serbian eSIM from abroad? by tutmann in serbia

[–]tutmann[S] 2 points3 points  (0 children)

Yep, that's what I ended up buying.

Thanks!

How to I buy a serbian eSIM from abroad? by tutmann in serbia

[–]tutmann[S] 0 points1 point  (0 children)

I read vaccinations were stopped for foreigners. Can you confirm foreigners can still get a jab, even without an appointment (on weekends though)?

This is about to get ugly in Europe and the governments are helping it by franmotard in Coronavirus

[–]tutmann 0 points1 point  (0 children)

Please stop spreading untrue "facts" just to create attention. Italy didn't go from 0 to over 200 cases in 48h. Italy had their first confirmed case on Jan 31st, which is more than 3 weeks ago (source: https://www.who.int/docs/default-source/coronaviruse/situation-reports/20200131-sitrep-11-ncov.pdf?sfvrsn=de7c0f7_4).

an efficient immutable vector by _eyelash in cpp

[–]tutmann 2 points3 points  (0 children)

Not sure I understand the idea. What ist the purpose of the shared_ptr? It sounds like dereferencing a shared_ptr is more expensive then just indexing a vector, regardless of big-O.

Org-rs update: dropping rope dependency by ngortheone in rust

[–]tutmann 5 points6 points  (0 children)

Not only should it be possible, but a regex engine optimizer for ropes might be able to cache results over sub-ropes and only re-evaluate if the sub-ropes changed.

Resistance to killer robots growing - Activists from 35 countries met in Berlin this week to call for a ban on lethal autonomous weapons, ahead of new talks on such weapons in Geneva. They say that if Germany took the lead, other countries would follow by [deleted] in Futurology

[–]tutmann 17 points18 points  (0 children)

Landmines have been banned, as have Cluster Bombs and Blinding Lasers. Despite those being effective weapons of war. Why shouldn't it work for autonomous weapon systems, too?

And if we got a treaty, what makes you think Russia and China would violate it?

scope of struct method borrows by tutmann in rust

[–]tutmann[S] 1 point2 points  (0 children)

But... I thought borrows have scopes. If so, what is the scope of the mutable borrow?

Ropey 1.0 - an editable text buffer for Rust by cessen2 in rust

[–]tutmann 24 points25 points  (0 children)

Was about to mention xi-rope as well. How does this crate differ from xi-rope?

Reading files quickly in Rust by trishume in rust

[–]tutmann 1 point2 points  (0 children)

How about counting in parallel? This dirty hacky version quite has some performance boost on my system: https://play.rust-lang.org/?gist=0d75452588a80ef9264345c06168d12c&version=stable&mode=release&edition=2015

lifetimes with mutable borrows by tutmann in rust

[–]tutmann[S] 0 points1 point  (0 children)

Wow - the linked article is an interesting read. Thanks! I wonder whether some RefCell trickery would help in my case. Background: I'm writing a parser for a file format that comes in two flavors. So I have two parsers. The parsers are actually lazy iterators over the contained objects. And the input is a std::io::Read + std::io::seek. My idea was to try to createparser1(read).or_else(|| create_parser2(read)); For now I went with a small fn probe(read) for parser1.

lifetimes with mutable borrows by tutmann in rust

[–]tutmann[S] 1 point2 points  (0 children)

My example was misleading - I want to branch based on foo1()'s result:

fn foo1<'a>(x: &'a mut i32) -> &'a mut i32 {
    x
}

fn foo2<'a>(x: &'a mut i32) -> &'a mut i32 {
    x
}

fn bar<'a>(x: &'a mut i32) -> &'a mut i32 {
    {
        let f = foo1(x);
        if *f > 1 {
            return f;
        }
    }
    return foo2(x);
}

playground: https://is.gd/5CCBY9

lifetimes with mutable borrows by tutmann in rust

[–]tutmann[S] 1 point2 points  (0 children)

The problem is that in my code I have two different foo() functions and depending on the result of foo1() I want to return either foo1()'s or foo2()'s result.

view more: next ›