spooningtamarin

9 ms·

31.
by spooningtamarin 11y ago
Uber is a good idea and can still be copied. Realistically, Uber is just an idea, and they got the money mostly for the idea. Even today Uber doesn't have advanced algorithms, Google had that immediately. Uber is just now trying to sol
32.
by spooningtamarin 11y ago
Yelp will perish, because, unfortunately, the moral quality of the individuals isn't high and the founders/CEO seem to be blind to it. As much as you need to be a very good business man to build a business that Yelp is, you need t
33.
by spooningtamarin 11y ago
There are plenty of algorithms with n^k where k>4, just not useful ones. Off the top of my head, checkout work by Eric D. Demaine. His work is on problems that seem very real, and solutions (algorithms) definitely show very lovely intera
34.
by spooningtamarin 11y ago
> Kids don't live in a vacum. Sure. They don't, but when they are just starting school they still don't know much about what is possible, and out there. > No one is talk about giving them freedom to do what they want. L
35.
by spooningtamarin 11y ago
Not really. How can they figure out they love ice skating if they never tried it? It is up to the parent to give direction to their child, not pressure them into something that they don't want but show them what is possible and out the
36.
by spooningtamarin 11y ago
There's definitely something wrong if it's so hard to go to 64-bit. This has been their problem for almost a decade.
37.
by spooningtamarin 11y ago
If you want to solve a recurrence, you can do that by assuming the general form of the solution (which is c*a^n for the above), or transforming it into exactly that polynomial you listed, you'd get something similar by using generating
38.
by spooningtamarin 11y ago
Exactly. The reason Newtonian physics is so successful is because almost anything can be described by a second order differential equation. The world behaves as simple as that and it would be quite weird if it required a larger order to des
39.
by spooningtamarin 11y ago
Any second order recurrence equation (second order equations are very common tools for real world modelling) will have a golden ratio in it. f(n) = f(n-1) + f(n-2) Regardless of the f(0) and f(1) you'll get a golden ratio.
40.
by spooningtamarin 11y ago
I believe a question was asked not to upset you but to make things clear. I'm not exactly sure why you want your comments to sound like you're a complete lunatic.
41.
by spooningtamarin 11y ago
Streaming fusion exists, and can easily be implemented in C++, that's what authors of this library should have done. C++ ranges library (proposition for C++17) will make this kind of thing possible without any overhead. Realistically,
42.
by spooningtamarin 11y ago
There are algorithms that can have an exponential speedup on a quantum computer, there are plenty that have a quadratic speedup, for example, searching an unsorted/unindexed database takes O(sqrt(n)) instead of O(n) (with high probabil
43.
by spooningtamarin 11y ago
It doesn't have to be a large text, but yes, this is currently under heavy research.
44.
by spooningtamarin 11y ago
Nim has much easier syntax than C#, why not that instead, has better type inference than C# too. Pythonesque in its core.
45.
by spooningtamarin 11y ago
I don't have to be familiar, you can know state of the art deterministic upscalers and their image quality, and know state of the art statistical upscalers and their image quality. When you see side-by-side for these upscalers, it&#x27
46.
by spooningtamarin 11y ago
Well, Sony Pictures is huge. Their database of movies is enormous. (Pride and Prejudice and Zombies is one of the movies distributed by Sony) Imagine they stored all of the movies they distribute in 4K in your TV. Whenever the movie is disp
47.
by spooningtamarin 11y ago
Yeah, I was surprised too when I heard that, but if you had a huge database of HD movies, you could train a NN yourself, see how it upscales, use some algorithms or different error functions to correct weird artifacts and put the trained we
48.
by spooningtamarin 11y ago
https://community.sony.co.uk/t5/blog-news-from-sony/inside-4... They won't tell you it's NNs but it is. Sony distributes a lot of movies, they use their database of movies to train the upscaling models (
49.
by spooningtamarin 11y ago
There are extremely large amounts of hardware based implementations. Any more complicated TV upscaler (Sony 4K TVs certainly) probably has a neural network embedded in it. Any algorithms working with images need FPGA implementations to be q
50.
by spooningtamarin 11y ago
https://agtb.wordpress.com/2012/04/01/automatic-proof-for-re... Love this one as a look into the future.
51.
by spooningtamarin 11y ago
They abide by the beautiful monadic laws.
52.
by spooningtamarin 11y ago
I always wanted something similar for C++ to exist. But people seem to think linting is entirely different than thing demonstrated here.
53.
by spooningtamarin 11y ago
I'm familiar with the literature. I do not like the research. It is bad, it's rarely reproducible, source code is almost never public thus time/convergence measurements are meaningless.
54.
by spooningtamarin 11y ago
It's probably corruption. It eliminates competition and breeds mediocrity. If your capital isn't allocated fairly results will be pretty bad.
55.
by spooningtamarin 11y ago
Checkout latest research in Vehicle Routing Problem, its filled with GA/Ants and similar nonsense. On the other hand you have TSP which murdered all those GA algorithms with a proper Lin-Kernighan heuristic implementation. I'm not
56.
by spooningtamarin 11y ago
I wouldn't say genetic algorithms are generic solutions. I have to try really hard to implement efficient operators that would allow me fast optimization. Scientific contributions are mostly in operators, I guess. I can't think wh
57.
by spooningtamarin 11y ago
Most of the time, heuristics are faster than operators in genetic algorithms. Same goes for heuristics being faster than exact solutions for harder problems.
58.
by spooningtamarin 11y ago
Genetic algorithms aren't really that brilliant. They are simple, and that's what makes them popular among researchers. There's no formal science behind them. I bet that thinking about the problem more would allow you to find
59.
by spooningtamarin 11y ago
> Is there a language X that allows you to write high performance X without huge amounts of profiling and time? Yeah, if high-performance is something faster than Haskell I'm already there with C++. If I understand copy/move se
60.
by spooningtamarin 11y ago
Laziness helps a lot with composition, when designing an interface you can have functions with arguments that won't be used by every implementation but have no performance overhead. Although, most of the time laziness is only useful at

More ›