Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
oxavier
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
1.
▲
by
oxavier
2mo ago
Really appreciate the effort put into a seemingly naive questions, thanks.
2.
▲
by
oxavier
3mo ago
Headroom uses RTK under the hood. I applaud the benchmarking though.
3.
▲
by
oxavier
5mo ago
This library serves as the basis of cloture[0] an effort to host Clojure on Common Lisp. I hope to see both projects thrive! [0] https://github.com/ruricolist/cloture
4.
▲
by
oxavier
1y ago
Looks like v3.0 just dropped, though after a very cursory glance at the release notes, I wonder what motivated the major bump specifically. I deploy on a single machine with Docker, as my apps are both small scale and non-critical (people p
5.
▲
by
oxavier
1y ago
I will peruse your learning path when I am done with writing my master's thesis. Thanks for putting it together! Lots of bullet points and keywords about the "What" : provable recursion, next-token prediction, and formal veri
6.
▲
by
oxavier
2y ago
My work is about inferring solutions to Constraint Satisfaction Problem by using belief propagation in the corresponding constraint network, a few keywords caught my eye here :) Do you have any illustrative example so I can understand bette
7.
▲
by
oxavier
2y ago
Not exactly the approach your describing, but Futhark[0] offers an alternative to CPU execution, it compiles to CUDA or OpenCL to run on GPU (or multi-threaded CPU). [0] https://futhark-lang.org/
8.
▲
by
oxavier
2y ago
I find this no-nonsense approach very appealing. > The more you render from the server, the larger your caches end up. Not doing that for HTML. Is HTML really that much larger or complex than JSON? Based on the following it seems to be o
9.
▲
by
oxavier
2y ago
> I suspect that all the free hobbyist FOSS labor artificially depresses dev salaries, hurting everyone else. Otherwise, the FAANGs would have to hire people to replicate what they currently get for free. The way I see it, FOSS enables a
10.
▲
by
oxavier
2y ago
Many thanks!
11.
▲
by
oxavier
2y ago
> Moreover, well-known algorithms for linear programming like simplex and primal-dual methods have straightforward (and illuminating!) combinatorial interpretations when restricted to minimum-weight bipartite matching. I you have any res