Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
bbminner
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
18 ms
·
91.
▲
by
bbminner
2y ago
When I was a teen, Symbian smartphones with a physical slide keyboards were all the rage, but too expensive for my budget. I was day dreaming of how cool that'd be to be able to ssh someplace from a phone via grps. I did it years later
92.
▲
by
bbminner
2y ago
The article is interesting, but I feel somewhat conflicted re "explaining motivations behind scientific discoveries". The author of the article is trying hard to find simple and elegant examples of applications (eg the optimal ora
93.
▲
by
bbminner
2y ago
True, even when you are writing a scientific publication with a hard page limits (~8 pages), it is advisable to reiterate the core messages multiple times as you add more context and details: = abstract 1) in this paper we show that X hold
94.
▲
by
bbminner
2y ago
I agree. I have limited experience with FPs, and I can get a hang of what is happening in OCaml examples relatively easily, but Haskell examples feel more like something akin to Forth - if I really needed, I could parse it with my brain, bu
95.
▲
by
bbminner
2y ago
I have been using code server over ssh for this purpose for years.
96.
▲
by
bbminner
2y ago
For years I have been fiddling with the idea of a personal task management system that synchronized status, due dates, prioritization, planning, projects, etc across platforms, and came to a conclusion that nothing beats a flat text file (w
97.
▲
by
bbminner
2y ago
I wonder what guarantees can be made wrt resource consumption. I suppose that'd reasonable to assume that in most (all?) cases an update is cheaper then recompute in terms of cpu cycles, but what about ram? Intuitively it seems like th
98.
▲
by
bbminner
2y ago
Ah, well, that's interesting! Does anyone know how cupy manages tensor mutability?
99.
▲
by
bbminner
2y ago
A complete novice question: I think I remember reading that Rust is moving from one of the standard type checking algorithms (this one?) to general purpose Z3 SMT for speed. Does type checking happen to have the same complexity as SMT? Or Z
100.
▲
by
bbminner
2y ago
Woah, what browser/page combination can fit into ~50Mb these days? I am simply used to the fact that most pages take at least 200Mb RAM in task manager.
101.
▲
by
bbminner
2y ago
For those less familiar with npd/bpd - at the core of both (and codependency to a certain extent) lies inability to self-regulate emotions (especially difficult emotions like shame), that makes people with these PDs use those around th
102.
▲
by
bbminner
2y ago
I have been reading about these kinds of projects for some time, and even prototyped my own a while back, but one question that keeps popping up is - all these python abstractions over how html and js and dom interact tend to be extremely l
103.
▲
by
bbminner
2y ago
Because accelerators (tpus, gpus) unlike ram/cpu are notoriously hard to timeshare and vitrualize. So if you get evicted in an environment like that, you have to reload your entire experiment state from a model checkpoint. With giant m
104.
▲
by
bbminner
2y ago
Bash uses readline, right? So > Tens of thousands of people probably use it every day without thinking about it. seems like an understatement.
105.
▲
by
bbminner
2y ago
For me, everything made sense when I read that generator functions in python can be used to implement algebraic effects, and algebraic effects and monads express the same ideas/logic using somewhat different language (and for some, inc
106.
▲
by
bbminner
2y ago
I happened to read a short story called "Foster, You're Dead!" not so long ago - which appears to have been Philip K. Dick's reaction to exactly these kinds of efforts.
107.
▲
by
bbminner
2y ago
> Things which are massively useful on desktop - like searching in a page or visually scanning a large doc are much harder on mobile Interesting, am I the only one who almost always uses "search on page" and glimpses/scrol
108.
▲
by
bbminner
2y ago
If we are talking about paper reviews, what I am looking for in a paper as a reviewer is neither simplicity nor complexity. I am not even looking for "novelty". What I am looking for is a thorough and thought-provoking empirical a
109.
▲
by
bbminner
3y ago
Exactly, I have always been curious about the same thing - if we have live statistics on queries then what stops us from cloning data (to correctly capture statics such as skew, etc.) and running these live queries with a bunch of knobs tun
110.
▲
by
bbminner
3y ago
When I started learning about Bayesian statistics years ago, I was fascinated by the idea that a statistical procedure might take some data in a form like "94% positive out of 85,193 reviews, 98% positive out of 20,785 reviews, 99% pos
111.
▲
by
bbminner
3y ago
So the argument is essentially that "not only if you pick the best thing fitting your finite data, but even if you take a weighted average over things that fit your finite data proportionally to how well they fit your finite data - yo
112.
▲
by
bbminner
3y ago
There's also an older work called PuppetGAN http://ai.bu.edu/puppetgan/
113.
▲
by
bbminner
4y ago
There's also MaskSketch from Google that will be presented at the upcoming CVPR https://github.com/google-research/masksketch
114.
▲
by
bbminner
11y ago
404 Not Found