Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
askee
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
by
askee
6y ago
It's also about performance. The snippet assumes the byte order of the buffer or byte stream is little endian so only covers two of four cases. If you want to read a little-endian byte stream on a big-endian machine, of course you need
2.
▲
by
askee
9y ago
Wasn't the mostly unanimous agreement in this thread that this paper was of low quality and its conclusions are questionable at best?
3.
▲
by
askee
9y ago
Also, it's "deus absconditus" not "abscondidus" in 1.
4.
▲
by
askee
10y ago
The k'th largest element in an array can also be found by the nth_element() algorithm already included in the STL. It has linear complexity as opposed to the O(n log k) and O(k log n) variants proposed here.
5.
▲
by
askee
10y ago
How good does it work with non-natural images where rows/columns are not similar to each other? White noise for example should prove rather difficult.
6.
▲
by
askee
10y ago
No it doesn't, unfortunately. I misunderstood OP's questions at first. You can connect owncloud to a mail server (a la Roundcube) but nothing more.
7.
▲
by
askee
10y ago
Self-hosted owncloud works for me except for the gruesome woes every single time I try to update it.
8.
▲
by
askee
10y ago
You would solve e.g. min_x* ( ||A x* - b|| (+\lamba regularization(x*) )
9.
▲
by
askee
10y ago
In general there are no shortcuts, and when the matrix A is not small (e.g. m x n with m,n << 100), you don't want to invert A, especially if you are only interested in x (from A x = b). Instead, use numerical minimization scheme
10.
▲
by
askee
10y ago
I find the wording somewhat peculiar: 'the resulting address will change dramatically, by (4 - 2^(32+2)). In 32-bit mode (all addresses modulo 2^32), this is just an increase by 4 as usual; the "wraparound" part is a multiple
11.
▲
by
askee
11y ago
Rasterization also is of highly-parallelizable nature and this parallelism has been exploited to great effect in the last decade(s). Given that Ray Tracing's only advantage over Rasterization is specular reflection it seems unlikely it
12.
▲
by
askee
11y ago
GCC already has something alike, the parallel mode [1]. It is based on the Multi-Core STL (MCSTL) developed at Karlsruhe University. In [2] you can also find some publications. As far as I know this already works quite well. [1] https:
13.
▲
by
askee
12y ago
> The important upside is that SV is the center of the universe for interesting computer science work. This is so true! (Even by my limited experience) Comparing job offerings in my home area vs offerings of any random company in the val
14.
▲
Ask HN: How's working in the Silicon Valley today?
37 points
by
askee
12y ago
|
23 comments
15.
▲
Ask HN: No interesting CS jobs in home market, moving to California worthwhile?
3 points
by
askee
12y ago
|
0 comments