NY_Entrepreneur

29 ms·

91.
by NY_Entrepreneur 15y ago
Part I "Anyway, who is claiming anything for their own?" From CLRS and much more, it is fully fair to say that CS is "claiming" that linear programming (LP) is part of CS. Beyond what I've mentioned so far about LP in CLRS, there is a much
92.
by NY_Entrepreneur 15y ago
"Succinct"? The book is 1000 pages and an "introduction" and the student's "first exposure", and you are comfortable with this juxtaposition? Early in my career, I got each volume of Knuth's TACP right away and dug in. No, I didn't solve
93.
by NY_Entrepreneur 15y ago
"Properly done CS _is_ maths." Okay, then you would agree with my thought on this thread that the math departments should just take over CS! The CS would get some much better math, and the math departments would get a big head and tummy ac
94.
by NY_Entrepreneur 15y ago
I was trying to be clear! The book is ballpark 1000 pages, and early parts of the book claim that it is trying to be unusually comprehensive. So, 'introduction' in the title conflicts with the breadth but is appropriate for the depth. May
95.
by NY_Entrepreneur 15y ago
"Do you have a source that supports you claim that CS has some of the best funding in academics and the most students? That doesn't seem likely to me." When I was a Big Ten prof, looked that way to me. From MIT, about all I hear about is t
96.
by NY_Entrepreneur 15y ago
For your "I find it hard to believe that you wrote", you might read my: "I'm sure that there is a lot of good material in that book, especially on core computer science topics." If you look carefully, then you will find that as my first sen
97.
by NY_Entrepreneur 15y ago
Learning 'math' as a good ugrad or grad student is NOT easy and involves a special step often called 'mathematical maturity' where the student learns to be good at reading and writing definitions, theorems, and proofs in math. This step is
98.
by NY_Entrepreneur 15y ago
'Math' has long had its own field. It is by a wide margin the oldest, deepest, most solid, most general subject in academics, a real crown jewel of civilization. 'Computer science' didn't want to be just part of math and wanted their own f
99.
by NY_Entrepreneur 15y ago
I'm sure that there is a lot of good material in that book, especially on core computer science topics. But the book is only an 'introduction' since for many of the topics for serious interest in practice it will be important to go deeper
100.
by NY_Entrepreneur 15y ago
There's a nice justification in http://news.ycombinator.com/item?id=2865396 So, we have a linear transformation from R^2 into R^2 with matrix 1 1 1 -1 So, the rows are orthogonal! And the columns! It's not quite an or
101.
by NY_Entrepreneur 15y ago
Nice! Then, if all this is correct, your solution should be nicely fast. Cute conversion of the metrics!
102.
by NY_Entrepreneur 15y ago
The conversion from the given metric to the 'taxicab' metric needs some justification! Else use just the n^2 approach or, if really want to struggle for something faster, then use my convexity approach. There may be another approach if can
103.
by NY_Entrepreneur 15y ago
The conversion from the given metric to the 'taxicab' metric needs some justification! The n^2 algorithm is simple enough to be solid. If your code does not give their answers, then their answers might be wrong! My work with convexity is a
104.
by NY_Entrepreneur 15y ago
CLRS can write what they want, but they can't rewrite what R. Bellman wrote. Part of the problem of 'what is dynamic programming' is that if permit the 'states' to keep growing in 'complexity' with the stages, then nearly anything can be ca
105.
by NY_Entrepreneur 15y ago
You may have a sufficiently tricky formulation to have a dynamic programming solution. But your states and stages are a bit strange! Much of why we use dynamic programming is that the work at stage i needs only the work at stage i + 1 (for
106.
by NY_Entrepreneur 15y ago
One famous application of dynamic programming is finding shortest paths in directed acyclic graphs. Maybe should credit E. Dijkstra. As I recall, that is not regarded as the most efficient such algorithm, but I haven't considered that pro
107.
by NY_Entrepreneur 15y ago
There is what 'dynamic programming' is, and there is the 'word segmentation' problem of this thread. The problem is interesting, and so are algorithms to solve it. My view is that algorithms to solve the problem are not really dynamic progr
108.
by NY_Entrepreneur 15y ago
I can outline. A good solution would need some theorems and proofs and need at least TeX for the typing, and I can't post TeX on HN. The problem is essentially in the field of 'facility location' which is a topic in essentially optimizatio
109.
by NY_Entrepreneur 15y ago
Yes, I can go along with the claim that the article uses memoization. But that 'memoization' is "equivalent to DP" is not correct, not even close to correct, really is just nonsense. What dynamic programming is has been solid, clear, and
110.
by NY_Entrepreneur 15y ago
Yes, from a fast reading, your solution appears to be correct, and so does 'memoization', but, still, in spite of common practice in computing, it's not a dynamic programming algorithm because what 'dynamic programming' is goes back to R. B
111.
by NY_Entrepreneur 15y ago
The author just mentioned dynamic programming. Usually in dynamic programming, e.g., as in Dreyfus and Law, to say that a problem has a dynamic programming solution we outline the solution. But the author did not outline such a solution.
112.
by NY_Entrepreneur 15y ago
You are jumping to misunderstand: I didn't say that your "making applicants solve problems" was bad, just that the problems, especially the third, in this thread are bad. "Unless you can make a convincing argument that the tests will decrea
113.
by NY_Entrepreneur 15y ago
"i think there are still tons of candidates who go to interviews but dont know how to code. ... As a fresh CS graduate, I feel like many of my classmates couldn't actually code, this would definitely help the companies to screen out peopl
114.
by NY_Entrepreneur 15y ago
The writing for the statements of the three problems has some severe errors at the level of eighth grade English and Algebra I. No one very good at solving those problems should spend their time on problems so poorly written. E.g., for the
115.
by NY_Entrepreneur 15y ago
Yup! I typed too fast! You are correct. I was thinking the right thing but typing the wrong thing! I'm too used to typine (n)ln(n)!. So, sure, worst case, n times have to do a heap 'sift' which is time proportional to ln(100) as you sa
116.
by NY_Entrepreneur 15y ago
Part II Sadly, last year I did have at least three infections, my first ever. All three were from Web browser usage. I don't know the sources of the first two, but the third infection was from one use of the Akamai download manager softwa
117.
by NY_Entrepreneur 15y ago
Part I Please seriously entertain my claim that the article is not to inform computer users about how to avoid 'malware' but, instead, is just a case of a standard practice in journalism to distort a real situation to create uninformed fear
118.
by NY_Entrepreneur 15y ago
Let's review Computer Security 101 with a case study in Mainstream Media Morality Play Nonsense 102: The article is garbage. Nonsense. Brain-dead. Trying to jerk people around by the gut. 'Vanity Fair' is for what, overly emotional, dete
119.
by NY_Entrepreneur 15y ago
I don't 'get it'. Sounds like an easy question and not "The Mother of All Interview Questions". But, for me, part of the answer is that the "process" has involved solving practical problems only in part with software, and some of the "inve
120.
by NY_Entrepreneur 15y ago
Part II So, what fraction of venture partners could look at such 'secret sauce' and evaluate it, say, like looking at and evaluating the wind tunnel of the Wright brothers? I can absolutely, positively assure you that the answer is, "may I

More ›