Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
randomizedalgs
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
26 ms
·
1.
▲
30% on AR-AGI-1 at $0.0007 per task
(arxiv.org)
3 points
by
randomizedalgs
20d ago
|
0 comments
2.
▲
by
randomizedalgs
1mo ago
Even the experts on the problem being solved find the writeups nearly impossible to read. Example: https://nitter.poast.org/henryquantum/status/208362369543662... Seems like a disservice to the community that open
3.
▲
by
randomizedalgs
2mo ago
After skimming some of the writeups, I'm surprised that the frontier internal model still writes just as poorly as Sol. Maybe good AI paper writing is further away than I thought...
4.
▲
by
randomizedalgs
8mo ago
I'm an active researcher in TCS. For me, AI has not been very helpful on technical things (or even technical writing), but has been super helpful for (1) literature reviews; (2) editing papers (e.g., changing a convention everywhere in
5.
▲
by
randomizedalgs
1y ago
For perspective, the CS programs in the NSF already have a two-submission limit per year [1]. Besides reducing the incentive to spam, this rule has had another positive effect: As a researcher without funding, you don't have to spend y
6.
▲
by
randomizedalgs
1y ago
For perspective, in the same time period, The number of employees at Google multiplied by five. I wouldn't be surprised if the growth of the software industry, at least, actually outpaced the increase in H-1B visas.
7.
▲
by
randomizedalgs
1y ago
For perspective, in the same time period, The number of employees at Google multiplied by five. It seems likely that the number of highly educated positions, in general, increased by quite a bit during that time.
8.
▲
by
randomizedalgs
2y ago
Cool paper! As a small comment, this seems closely related to another recent paper: History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures (PODS 2024, Best Paper). I'm not sure how they compare, si
9.
▲
by
randomizedalgs
3y ago
I don't think the claim is true in quite as much generality as the author claims. Some deterministic data structures use much more space than time, for example, the deterministic implementation of a Van Emde Boas tree.
10.
▲
by
randomizedalgs
3y ago
Maybe quotient filters?
11.
▲
by
randomizedalgs
3y ago
I think you may have a backwards. Libcuckoo, CLHT, and TBB are widely used high performance C/C++ DRAM hash tables. I think TBB is the hash table Intel maintains, if I remember right. So the DRAM experiments are apples to apples. It&#x
12.
▲
by
randomizedalgs
3y ago
I think these are more-often called "cache oblivious" algorithms
13.
▲
by
randomizedalgs
3y ago
IcebergHT isn't just for persistent memory (although I can see why you might think it is based on the paper's title). The paper also gives experiments showing that the hash table performs very well in standard RAM, much better tha
14.
▲
by
randomizedalgs
3y ago
As a super minor grammar point for the author, "ubiquitous" is a rare example of a word that starts with a vowel but should be proceeded by "a" instead of "an".
15.
▲
by
randomizedalgs
3y ago
Consider the imaginary world that the author describes, in which people's estimate of their score is independent of their actual score. Wouldn't it be fair to say that, in this imaginary world, the DK effect is real? The point of
16.
▲
by
randomizedalgs
5y ago
The randomized version of this algorithm is also fun: repeatedly find an edge that is not yet covered, select one of the two end points at random , and add it to S. It's a nice exercise to show that the randomized algorithm is also a
17.
▲
The Simplest Interesting Algorithm (2019)
(algorithmsoup.wordpress.com)
2 points
by
randomizedalgs
5y ago
|
2 comments
18.
▲
by
randomizedalgs
5y ago
This is a classic example of price discrimination. Slowly but surely, companies such as Toyota will converge to a state where every consumer individually pays the maximum amount that the consumer is willing to pay for the product. $8 a mont