vbarrielle

10 ms·

91.
by vbarrielle 6y ago
> Our time counting is 1-based. Not in every part in the world. Here in France, we use 24h time, and midnight is 00:00. Very convenient.
92.
by vbarrielle 6y ago
For vim users fugitive is a very good plugin that does at least some of these (I'm not using it to the full extent of its capacity so I cannot be sure).
93.
by vbarrielle 6y ago
Which browser are you using? I've got no issue with around 50 tabs in Firefox in a similar laptop. But maybe I don't visit the same memory heavy websites. It's usually gcc that eats up all my memory, turns out with template m
94.
by vbarrielle 6y ago
The unified memory actually means more RAM usage as textures that would only exist in the GPU RAM now have to live in the unified RAM. Unified memory is a great performance improvement but I don't think it translates into lower RAM usa
95.
by vbarrielle 6y ago
Agreed, I find per-parameter docs useful in dynamic languages such as python, or to a lesser extent useful when the type system is weaker (in C), but in Rust I seldom find them useful. This can be useful to express constraints not present i
96.
by vbarrielle 6y ago
This paper does not look like a strong paper, in particular it's very terse when describing the way the neural network is trained, which fails to convince that they did not train the neural network model on the sorted input. They are a
97.
by vbarrielle 6y ago
Haskell typeclasses are quite close to Rust traits, does Haskell count as OOP then?
98.
by vbarrielle 6y ago
I suppose it has to do with the Schwarzschild radius of such a black hole being really small, I guess it would be something like 10^-8m according to https://en.wikipedia.org/wiki/Schwarzschild_radius which means almost
99.
by vbarrielle 6y ago
Tried it a few months ago, it works.
100.
by vbarrielle 6y ago
You're completely right, I had forgotten about constructive geometry. Thanks for pointing it out!
101.
by vbarrielle 6y ago
This representation is useful to reason about products in general, but I don't see how it can be used to compute a specific product.
102.
by vbarrielle 7y ago
I missed that ellipsis cue, thanks for pointing it out. The complete excerpt is not in the complete paper though, but it's probably in their released data.
103.
by vbarrielle 7y ago
The example figure has a weird entry for the summary task. The input is: "summarize: state authorities dispatched emergency crews tuesday to survey the damage after an onslaught of severe weather in mississippi..." And the output
104.
by vbarrielle 7y ago
In France 75% of our electricity is produced with nuclear power, and we're able to dynamically change its power to follow demand (though we also use hydro power plants to deal with shorter term variations). And we have one of the cheap
105.
by vbarrielle 7y ago
> The laziest profiler is to interrupt your program with ^C. If you do this twice and get the same stack trace, it's a good bet that's where your hotspot is. I do that sometimes, but it has some pitfalls. If most of the time is
106.
by vbarrielle 7y ago
The very popular C++ linear algebra library Eigen has bounds checking for matrices by default, but you can turn them off when defining NDEBUG. This means most out of bounds accesses are found during development.
107.
by vbarrielle 7y ago
Not exactly shaders, but for GPGPU stuff, futhark [0] seems to show that a functional paradigm can be very good to produce performant and readable code. [0] https://futhark-lang.org/index.html
108.
by vbarrielle 7y ago
I setup it on my computer, used it to count the lines of 250 files, it is indeed faster than my system's (ubuntu 18.04) wc, but it doesn't compute the total. I don't think this should change the timings much though. A best of
109.
by vbarrielle 7y ago
While I wouldn't be surpised that OCaml is fast, I'd like to be sure your disk cache was warm in both cases. I'd test it myself, but I don't have OCaml setup on my work computer.
110.
by vbarrielle 7y ago
There's a research language that supports compile-time checking of array dimensions: futhark [1]. It's an interesting language that compiles to CUDA or OpenCL. However it's probably not ready for production (not sure if there
111.
by vbarrielle 7y ago
Random forests can be applied to images. The RF algorithm only needs to be tweaked to split its trees by comparing the difference of two pixels to a threshold.
112.
by vbarrielle 7y ago
Physics simulation is a very active computer graphics research topic (see e.g. the SIGGRAPH conference). The goal in computer graphics research will not be to have an exact result, but to have a visually plausible (and pleasing) result as f
113.
by vbarrielle 7y ago
> Preallocate and pool what you might need, don't call new in your tight loop. This piece of advice is also valid in languages without GC. In C++ it's well known one should avoid allocating memory in tight loops, and it's
114.
by vbarrielle 7y ago
The abstractions inside Eigen are there to enable powerful compile time optimisations, such as compiling the addition of three vectors `Eigen::VectorXf x = a + b + c;` in a single loop instead of naively allocating a temporary to evaluate `
115.
by vbarrielle 8y ago
Rust can be compiled without glibc, by statically linking to musl, but it looks like it's still experimental as the only distribution of it is on the nightly channel: https://static.rust-lang.org/dist/rust-nightly
116.
by vbarrielle 8y ago
In french "un billion" is 10^12.
117.
by vbarrielle 8y ago
You can get closer to second order if your error is a sum of squares of the form 0.5 * f^T * f, in which case you case compute the jacobian J of the fitness f, and approximate your hessian as J^T * J. That's the Gauss-Newton method and
118.
by vbarrielle 8y ago
That theorem only implies global convergence for convex or pseudoconvex functions. For a generic function it only guarantees convergence to a local minimum.
119.
by vbarrielle 8y ago
No his bowl is convex, so it cannot be a saddle point, which are points where there is both a positive curvature and a negative curvature.
120.
by vbarrielle 8y ago
I'm curious how one gets long names from a windows pc given the path length limits on windows https://stackoverflow.com/a/1880453 Maybe I'm not understanding that limit correctly but it looks like the whole p

More ›