- "Despite its ubiquity in deep learning, Tensor is broken. It forces bad habits such as exposing private dimensions, broadcasting based on absolute position, and keeping type information in documentation. This post presents a proof-of-concept of an alternative approach, named tensors"
- IQ Test questions on numbers
- I was reading about Power over Ethernet (PoE) and in the applications of a PoE splitter it was shown that a non-poe device was connected to another non-poe device using an injector and a splitter
- Avlbinstree - AVL self-balancing binary search trees for TypeScript/JavaScript
- Nonconstructive proof of P = NP
| Posted: 30 Jun 2019 06:58 AM PDT |
| Posted: 01 Jul 2019 04:34 AM PDT
Feel free to leave your answers and explanations. [link] [comments]  |
| Posted: 01 Jul 2019 02:05 AM PDT first passing the power and network cable through a poe injector and the common cable (power + ethernet) was passed through a poe splitter which then provided power and ethernet to the non-poe recipient device with separate cables, my question is why use injector and splitter instead of directly connecting the two devices using the two already separate power and ethernet cables [link] [comments]  |
| Avlbinstree - AVL self-balancing binary search trees for TypeScript/JavaScript Posted: 30 Jun 2019 05:50 PM PDT |
| Nonconstructive proof of P = NP Posted: 30 Jun 2019 05:04 PM PDT This is a short abstract: P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? A precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity class is coRP. Whether NP = coRP is another fundamental question that it is as important as it is unresolved. It is known when P is not equal to NP, then NP is not equal to coRP as well. To attack the P versus NP problem, the NP-completeness is a useful concept. We prove there is an NP-complete problem in coRP. In this way, we obtain that NP is indeed equal to coRP. Consequently, by contraposition we demonstrate the complexity class P is equal to NP. This is the public preprint: https://www.academia.edu/39721020/Solution_of_the_P_versus_NP_Problem Any advice or positive comments are always welcome, For those who believe a persistent claimer should be a crank, think kindly on this phrase: Thomas A. Edison quotes: "I have not failed. I've just found 10,000 ways that won't work." Thanks in advance!!! [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