Yoshua Bengio on the Turing Award, AI Trends, and ‘Very Unfortunate’ US-China Tensions Computer Science |
- Yoshua Bengio on the Turing Award, AI Trends, and ‘Very Unfortunate’ US-China Tensions
- Suggestions for an OS course with a good series of exercises/assignments to go with
- A study says machine learning algorithms applied to to biopsy images can shorten the time for diagnosing & treating a gut disease that often causes permanent physical & cognitive damage in children.
- CVPR 2019 | Waymo Introduces Open Dataset to Accelerate Autonomous Driving Research
- Solution for two major unsolved problems in complexity theory(sent and accepted into a conference)
- Mit 6.004 computation structures
- Why has Microsoft kept the IE/Edge browser alive?
| Yoshua Bengio on the Turing Award, AI Trends, and ‘Very Unfortunate’ US-China Tensions Posted: 17 Jun 2019 11:47 AM PDT |
| Suggestions for an OS course with a good series of exercises/assignments to go with Posted: 17 Jun 2019 07:53 AM PDT Ive done an introductory OS course but there wasnt much hands on stuff(neither did I do the final project well). I'm looking to learn these concepts properly and wanted to know which is the best MOOc type course to follow which comes with a solid set of assignments which I can work on on my own to reinforce the concepts. [link] [comments]  |
| Posted: 18 Jun 2019 03:11 AM PDT |
| CVPR 2019 | Waymo Introduces Open Dataset to Accelerate Autonomous Driving Research Posted: 17 Jun 2019 09:07 AM PDT |
| Solution for two major unsolved problems in complexity theory(sent and accepted into a conference) Posted: 17 Jun 2019 08:57 PM PDT Dear Fellow, When you work into a problem one has to attack both sides. I decided to propose a solution where P is not equal to NP. I know this is opposite of my previous arguments, but this time the manuscript is simpler to explain it which is a positive property that makes the proof even more understandable and practical to debate. I have found a proof that no one has found before and the trick is the lower bound in finding a maximum into a collection with n positive integers is within n - 1 comparisons. We define a problem which is equivalent to this previous one, but the bit-length is exponentially more succinct than n. Consequently, the problem should not be in P. We show this problem is in coNP. In this way, we prove P is not equal to coNP and thus P is not equal to NP. I send this paper to a conference to be reviewed and I shared in a preprint link https://www.academia.edu/39617545/A_Solution_of_the_P_versus_NP_Problem Moreover, I have a proof of L = parity-L that was accepted by a conference this year. I shared this also in a preprint link https://www.academia.edu/39345145/The_complexity_of_class_L In the accepted paper for a conference: I have a logarithmic space algorithm for XOR-3SAT that no one has found before and the trick is that I noticed this can be logarithmic space reduced to the language MONOTONE XOR-4SAT and thus, this problem is hard for parity-L. Besides, I noticed that an instance of MONOTONE XOR-4SAT is indeed equivalent to an instance of XOR-2SAT which is in SL. Certainly, a clause of MONOTONE XOR-4SAT when (a + b + c + d) is satisfiable under some truth assignment if and only if a + b and c + d have different assignments for the same truth assignment, that is if x = a + b and y = c + d where (x + y) is satisfiable and + is XOR operation. However, we do not use XOR-2SAT for the logarithmic space reduction. Indeed, we use the another SL problem that is HITTING-SET-2 which is whether a subset from a "universe" set U can intersect exactly one element for every set S_i that is within a list of sets of elements from the same "universe" set U such that the cardinality of each set S_i is at most 2. This guarantee in a reduction for each clause (a + b + c + d) that a+b and c+d should exist in the same set S_j and thus, they should be intersected exactly one of them by a subset of U, so one of the formulas a+b and c+d could be true and the other false according to this intersection. In this way, we guarantee if we cannot separate the elements of some set S_j that we obtain in the reduction by a subset Any comment or advice is welcome, [link] [comments]  |
| Mit 6.004 computation structures Posted: 17 Jun 2019 06:33 AM PDT |
| Why has Microsoft kept the IE/Edge browser alive? Posted: 17 Jun 2019 11:52 PM PDT In the global market share IE/Edge doesn't even show up in the top 4 browsers: http://gs.statcounter.com/browser-market-share . But my company(financial institution) always asks for compatibility with IE/Edge even for React16+ applications. And the polyfills that are used for this compatibility are just unnecessary for this age. So my question is that why does Microsoft keep it alive and never keep up with the web standards? [link] [comments]  |
| You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States | |
No comments:
Post a Comment