utopcell

8 ms·

91.
by utopcell 10mo ago
Need the what now?
92.
by utopcell 10mo ago
nicely done.
93.
by utopcell 10mo ago
Very strong statement on the title, given the following limitation: > Generation tasks. Method applies to classification only. Preliminary decoder experiments show perplexity increases.
94.
by utopcell 10mo ago
I really don't see the benefit of this over, say, pixel buds.
95.
by utopcell 11mo ago
..we found an off the shelf keyboard that could work, but we couldn't get it because it was 999 euros. So let's make 7 iterations of our own keyboard with our Formlabs 3d printer, create silicom molds for each key, print legends w
96.
by utopcell 11mo ago
I'd watch a video about the making of this video.
97.
by utopcell 11mo ago
The disrespect towards these people is unfathomable.
98.
by utopcell 1y ago
definitely laggy, but works even under low lighting conditions and a camera that is not facing straight forward.
99.
by utopcell 1y ago
That was a blast from the past! Many, including me, surely still have those Wii sensors/controllers around. Fun times!
100.
by utopcell 1y ago
How low can this go? Can this run on a 5090 card (32GiB)?
101.
by utopcell 1y ago
..or, as Aristotle put it more succinctly: "those who can, do; those who understand, teach".
102.
by utopcell 1y ago
I searched on my work browser, on my personal browser, on the phone (mobile + desktop page) and in all cases I use the link to midjourney.com first. The spirit of the question I can subscribe to though: too many ads on top of the results th
103.
by utopcell 1y ago
It should be the city's responsibility to add a hysteresis to the reported data; perhaps this was already there.
104.
by utopcell 1y ago
I have three tokens for you: Son, of, Anton.
105.
by utopcell 1y ago
You've done an amazing job. This is buttery-smooth even when zooming in. Awesome!
106.
by utopcell 1y ago
Chris from Clickspring, the canonical YouTube machinist who has been slowly but accurately reconstructing the Antikythera mechanism for about one decade now. - https://www.youtube.com/@Clickspring
107.
by utopcell 1y ago
Fun fact: I only recently found out that regular 1.44MB floppy disks could be formatted to 32MB.
108.
by utopcell 1y ago
I would be very interested to know what material was used and how these magnetic films were created back in the 80s. Please share any info that you have!
109.
by utopcell 1y ago
This fascinating engineer [1] has actually achieved making tapes and floppies from scratch [2]. [1] https://www.ninakalinina.com/ [1] https://www.ninakalinina.com/links.htm / "DIY tapes and floppi
110.
by utopcell 1y ago
While it is a great video, it doesn't seem like he actually made a viable floppy disk in the end. Even if he didn't though, it would have been great to say what was actually achieved in the end: what write density was achieved? Co
111.
by utopcell 1y ago
The Google team used Chisel instead of SystemVerilog. You could consider switching to that if it makes sense for your project.
112.
by utopcell 1y ago
tang nano 20k. You can't find any cheaper fpga board than this.
113.
by utopcell 1y ago
This particular LLM did not get an IMO Gold.
114.
by utopcell 1y ago
"In fairness to GPT5, in my career I have indeed encountered PhDs with this level of commitment to their particular blueberry." Nicely phrased!
115.
by utopcell 1y ago
Godspeed.
116.
by utopcell 1y ago
> This project is the result of months of experimenting [..] It shows, this is awesome, especially that rice paper effect!
117.
by utopcell 1y ago
[ made this a top-level comment as I don't see it mentioned in other comments: ] The result doesn't actually apply to _all_ algorithms, only oblivious ones. Oblivious algorithms are ones where step i does not depend on decisions m
118.
by utopcell 1y ago
Given your username, I'm sure whoever inherits your codebase would share the same sentiment.
119.
by utopcell 1y ago
The result doesn't actually apply to _all_ algorithms, only oblivious ones. Oblivious algorithms are ones where step i does not depend on decisions made in steps j < i. Almost all useful algorithms are non-oblivious, with some notab
120.
by utopcell 1y ago
This is a worst-case result. In the best case, it is easy to see that the gap can be exponential. Imagine a program that increments a counter until it reaches value n. This "program" would only need O(logn) memory: mainly the coun

More ›