Intel Is Working On A New 'Data Parallel C++' Programming Language Computer Science |
- Intel Is Working On A New 'Data Parallel C++' Programming Language
- Pitfalls in bringing machine learning algorithms to production
- Libra Protocol Validator Node Clarification
- Lecture Notes I scribed for an weighted automata course (Should be quiet self-contained if you have some rudimentary background)
- Sharing stackexchange questions via links. MYSTERIOUSLY results into downvotes on said question. An unwelcome response.
- Building applications tutorial sites or mentorship
- Help finding an essay by a computer scientist?
- Microsoft Obj-GAN Turns Words into Complex Scenes - SyncedReview - Medium
- Curve Fitting
- Breakthrough result: L = parity-L
Intel Is Working On A New 'Data Parallel C++' Programming Language Posted: 25 Jun 2019 02:09 PM PDT |
Pitfalls in bringing machine learning algorithms to production Posted: 25 Jun 2019 11:28 AM PDT |
Libra Protocol Validator Node Clarification Posted: 26 Jun 2019 02:16 AM PDT Hello, I'm reading the following introduction but I can't quite grasp what the storage part of the Validator accomplishes. https://developers.libra.org/docs/libra-protocol I get that it is used to store the block of transactions and their results, but I'm not sure how it interacts with the Merkle tree (which is where each transaction is stored as a leaf). Do you have any insight? [link] [comments] |
Posted: 26 Jun 2019 12:42 AM PDT |
Posted: 25 Jun 2019 08:41 PM PDT Have you noticed a large increase in downvotes after you try to boost your odds of getting an answer to your question? Is there some kind of rule that says you can't try to get an answer? [link] [comments] |
Building applications tutorial sites or mentorship Posted: 25 Jun 2019 04:39 PM PDT Hi there I've not developed anything for a few years. Looking to get back into it in a fun way but at a beginner / intermediate level. Do you know where I can follow tutorials on Java / C# to start with and then I can take it from there. Need a bit of hand holding for start. Alternatively if any mentors out there wanna take me on, just PM me. I learnt in Java for 2yrs had a job in C# for a year and then did a bit of web development too. I then got sick and haven't been infront of a computer to learn anything for the last 15mths. Would really appreciate some help and guidance. I don't want to fry my brain out by starting from scratch with an idea in these languages so hence need a bit of hand holding prior to then developing my ideas from scratch , call it confidence and self esteem building. Thanks in advance. [link] [comments] |
Help finding an essay by a computer scientist? Posted: 25 Jun 2019 07:52 AM PDT I remember reading it a few years ago, it was very well written and motivational. Think the main message was going into the topic of "why are you not doing what you really want to be doing" or something along those lines. IIRC, he was a British computer scientist and died sometime in the late 80s. I remember looking him up at the time but can't find him or the essay again. There's a possibility he might've worked at Bell Labs or had a connection with Claude Shannon, but I could be way off base here and remembering incorrectly. If anyone knows what I'm talking about or at least has an inkling. [link] [comments] |
Microsoft Obj-GAN Turns Words into Complex Scenes - SyncedReview - Medium Posted: 25 Jun 2019 12:17 PM PDT |
Posted: 25 Jun 2019 09:17 AM PDT What parameters are meant for My understanding so far:
Am I interpreting it correctly? [link] [comments] |
Breakthrough result: L = parity-L Posted: 25 Jun 2019 01:21 PM PDT 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. In this way, the reduced instance in XOR-2SAT is satisfiable if and only if the original Boolean formula in MONOTONE XOR-4SAT is satisfiable. Since SL = L, then the proof is completed. https://www.academia.edu/39694101/L_versus_L Any comment or advice is welcome, Thanks in advance, Frank [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