chillee

25 ms·

211.
by chillee 8y ago
Yeah, that's definitely the direction people seem to be moving towards.
212.
by chillee 8y ago
Some examples where order of computation isn't that trivial is when you're doing DP on trees or a DAG. +1 to the "filling in a subset" part. Usually it's not too relevant because it's merely a constant factor c
213.
by chillee 8y ago
Yeah, you're right. The subproblems must overlap.
214.
by chillee 8y ago
This is one definition, but I don't think it's the common one. The more common definition is that dynamic programming refers to solving a complicated problem by breaking it up into simpler overlapping subproblems that can be solve
215.
by chillee 8y ago
I actually disagree. Of the problems that are commonly asked in programming interviews, DP is perhaps the one that tests "general problem solving" the best. Many other problems require problem-specific tricks/uncommon tricks.
216.
by chillee 8y ago
I'd say that in competitive programming, bottom-up is actually preferred. Bottom up is faster, usually shorter to code, and allows certain kinds of optimizations you can't do with top down (sliding window, convex hull trick, etc
217.
by chillee 8y ago
I really doubt it. The type of reasoning needed for dynamic programming interview problems is barely connected to DP in reinforcement learning.
218.
by chillee 8y ago
Facebook does a lot of work like this for its internal development uses (also, when it used to open source Nuclide). I think this is a good first step, but there's a lot more problems that are harder to solve than what this offers (and
219.
by chillee 8y ago
It seems that award citation isn't exactly correct. See https://amturing.acm.org/award_winners/milner_1569367.cfm for where the blurb can be found. It appears to be part of a biography that one can find for every
220.
by chillee 8y ago
Interesting article on why this is a problem, some effects that this "attention sapping" has had on the labor force and how it alters the traditional labor-supply curve, and a somewhat fun proposal to "tax media companies for
221.
by chillee 8y ago
There's a lot that's uneviable about Stamos's position - his compensation is not one of them.
222.
by chillee 8y ago
Just a note, unless you have negative edges, running V Dijkstra's is likely to perform better than Floyd Warshall. Dijkstra's gives you distance from a single node to all other nodes in V log E time. If you run it V times, you&#x2
223.
by chillee 8y ago
The way it works is that although high schoolers using FB has leveled off, they tend to start making FB accounts after high school, when many of their friends are no longer reachable by simply meeting up with them in class.
224.
by chillee 8y ago
I believe Watch is their separate page for video, and not the autoplay videos that show up as you scroll down your feed. It'd seem pretty surprising that consumers would repeatedly click on that page and get tricked into watching a sig
225.
by chillee 8y ago
Three Chinese movies I've seen get fairly widespread acclaim are: 1. Hero 2. Flowers of Shanghai 3. The Legend of the Drunken Master
226.
by chillee 8y ago
I'd say the vast majority of people in China do support the system.
227.
by chillee 8y ago
This is my go-to example of the type of hilariously terrible Quora answer that plagues the site: https://www.quora.com/How-do-I-learn-competitive-programming... 90% of that "advice" could be copy pasted onto any &
228.
by chillee 8y ago
Of special note is the unordered_map/unordered_set implementations. https://news.ycombinator.com/item?id=7849213#7849607
229.
by chillee 8y ago
One hidden layer. Commonly known as the "Universal approximation theorem"
230.
by chillee 8y ago
I'd say things like AlphaGo are "fundamental research". Really, any of the top tier AI labs do what's often considered blue skies research, and have a huge concentration of talent. Microsoft also has a long legacy of fu
231.
by chillee 8y ago
More relevantly, if people actually read the blog post, they'd see that this has been merged into the core Python extension, and is being worked on there.
232.
by chillee 8y ago
Have you considered posting this on www.codeforces.com? They have the biggest active community of competitive programmers, and I'm sure they'd find this fascinating. You'd also probably get a lot of good feedback from competi
233.
by chillee 8y ago
I don't think the target audience is true Japanese candy connoisseurs; if anything, it's the opposite. Many people are interested in trying out Japanese candy, the issue arises in knowing where to order from and what to order. Get
234.
by chillee 8y ago
So the typical sieve of Eratosthenes is O(N log log N). Perhaps surprisingly, you can actually write a sieve that's O(N).
235.
by chillee 8y ago
Whups, my bad. Arrays are rare, lists are very common.
236.
by chillee 8y ago
Well, any bugs you would get are very immediate (due to the strong static typing). As for your other point, lists are fairly rare. You only need arrays when you need arbitrary indexing into a list. Most of the time, however, you're sim
237.
by chillee 8y ago
Ooohhh, this is something that I've been meaning to get back to... There was an atrociously bad "undoing work" issue that I popped out of hiatus to fix, and that bug was the cost of the fix. I meant to add proper support for
238.
by chillee 8y ago
What's the bug that you have with `2d}`? It seems to work fine for me. There shouldn't be any reason that it reruns save upon entering/exiting insert mode; are you sure you don't have some kind of keybinding/other s
239.
by chillee 8y ago
Somewhat interestingly, C++ STL unordered_map is so much slower than it needs to be: https://www.youtube.com/watch?v=fHNmRkzxHWs&t=47m13s Using one of the policy-based data structures instantly gets you about an order m
240.
by chillee 8y ago
Practically all singers use "pitch correction", which is essentially "autotune that's not done for artistic effect". If done properly, it's not really janky or fake sounding at all.

More ›