Need some help understanding this rope algorithm from CTCI Computer Science |
- Need some help understanding this rope algorithm from CTCI
- For a TINY 3d rendering (for projecting ONLY 3d points, lines & polygons), I'm currently thinking about an elegant hidden points removal algorithm, given that polygons are only defined by their vertices and line segments are only defined by their 2 end points. Ideas?
- A Look into Uber’s Futuristic Self-Driving Cars Technology
- Water Jug Problem: Can't understand the tree Representation
- How useful is a bachelor's degree in mathematics to understand computer science and programming???
- Recovering multi-person 3D poses from a single RGB image!
- Machine Learning for Finance: This is how you can implement Bayesian Regression using Python
- Python is good, but why, I can't explain.
- Is there an efficient algorithm for replaying or undoing and redoing actions?
- Excel vs Minitab: Which is More Powerful
- Can ever the theoretical power of AI system be greater than of a Turing Machine?
- Crop circles
- [R] High-Speed Privacy Protection: Facebook Opacus Trains PyTorch Models With DP
- Visualization of the Defective Chessboard Problem
- Best Data Science Courses Online
- I am trying to build a programmable board with an i3 proccesor. is it possible and if yes is it cost effiecient?
- Add dynamically generated GitHub ��Trophy on your readme
- [R] We really need to rethink robust losses and optimisation in deep learning!
- [R] Feedbacks on Progressive Self Label Correction
- "Sexpr aren't always superior"
| Need some help understanding this rope algorithm from CTCI Posted: 02 Sep 2020 04:05 PM PDT The problem: The solution then goes on to use the corollary that if you light the rope from both ends, the flames will meet after exactly 30 minutes. This is my issue with the proposed solution. If the rope's density is not guaranteed to be even then how can lighting the rope in this way guarantee they will meet after 30 minutes? Couldn't you have a rope that is very dense on both ends but not in the middle? [link] [comments]  |
| Posted: 02 Sep 2020 08:49 AM PDT |
| A Look into Uber’s Futuristic Self-Driving Cars Technology Posted: 03 Sep 2020 02:35 AM PDT |
| Water Jug Problem: Can't understand the tree Representation Posted: 02 Sep 2020 09:58 PM PDT Hi, I am trying to understand the Water Jug Problem. It can be represented by a tree but I can't understand that representation. I have following questions about thee tree:
Zulfi. [link] [comments]  |
| How useful is a bachelor's degree in mathematics to understand computer science and programming??? Posted: 02 Sep 2020 09:57 AM PDT I am just interested because I want to know how useful mathematics is to understanding programming and computer science. I wanted to know how it can be useful in being a better software engineer/programmer. I wanted to know how realistic is it to get hired as a software engineer/data scientist with ONLY A BACHELOR'S DEGREE IN MATHEMATICS. Is this even possible??? [link] [comments]  |
| Recovering multi-person 3D poses from a single RGB image! Posted: 02 Sep 2020 04:58 PM PDT |
| Machine Learning for Finance: This is how you can implement Bayesian Regression using Python Posted: 02 Sep 2020 05:06 PM PDT |
| Python is good, but why, I can't explain. Posted: 02 Sep 2020 06:08 AM PDT Hello there, I know a bit of everything but not even close to be a senior dev yet. My friend only learned Java in collage and thinks Python for actually kids who is into programming or just engineers that needs more than a scientific calculator. I think he is wrong but even I don't have enough knowledge to say otherwise. Why Python is such a powerful language, why it is generally used in AI/ML Thank you for your answers [link] [comments]  |
| Is there an efficient algorithm for replaying or undoing and redoing actions? Posted: 02 Sep 2020 01:34 PM PDT I'm working on a pet project where I have a list of all commands serialized into JSON format along with a timestamp. I want to efficiently reconstruct the state at any given time by replaying these actions. Has anyone come up with an algorithm for something like this? Example: Action 1 -- 5PM Action 2 -- 5:02PM Action 3 -- 5:03PM Action 4 - 5:50PM ... etc. Given these actions I want to be able to reconstruct the state at any time using all of the actions leading up to that time point. Obviously there's the naive solution of just going through the entire document starting from the beginning and applying each action, but this is infeasible for very large lists of commands. Thanks! [link] [comments]  |
| Excel vs Minitab: Which is More Powerful Posted: 02 Sep 2020 08:36 PM PDT |
| Can ever the theoretical power of AI system be greater than of a Turing Machine? Posted: 02 Sep 2020 08:04 PM PDT So I have heard many people talk about AI singularity and we should always be careful with it but I always thought that if AI is computing stuff then it is not greater than a Turing Machine and today our professor told us that he does not believe that AI singularity ( like when AI gains consciousness ) is b*llshit because of Godel's incompleteness theorem ( which can be actually reduced to the decidability of Turing Machine, done by Stephen Kleene so basically it is my original question ). But I am also a fan of dystopian cyberpunk (Deus EX and all that lol) and I do not like this limitation, also all of this research is going in AI by lot of people. So, is this statement true? [link] [comments]  |
| Posted: 02 Sep 2020 10:31 PM PDT People are quick to deny whether crop circles are real. However has anyone ever tried to actually do a in depth analyses on the patterns that form in these structures, to see if some sort of information can be interpreted from them? Perhaps if we actually can get binary out of the structures, and make it somewhat comprehensive, we might actually be onto something. And if we are not, we could just check it off. [link] [comments]  |
| [R] High-Speed Privacy Protection: Facebook Opacus Trains PyTorch Models With DP Posted: 02 Sep 2020 11:50 AM PDT In a bid to provide an easier path for researchers and engineers seeking to adopt differential privacy (DP) in machine learning (ML) and help accelerate DP research in the field, Facebook AI this week released a new high-speed library called Opacus. Here is a quick read:High-Speed Privacy Protection: Facebook Opacus Trains PyTorch Models With DP The Opacus library has been open-sourced on GitHub. [link] [comments]  |
| Visualization of the Defective Chessboard Problem Posted: 02 Sep 2020 11:46 AM PDT |
| Best Data Science Courses Online Posted: 02 Sep 2020 10:54 AM PDT |
| Posted: 02 Sep 2020 12:15 PM PDT |
| Add dynamically generated GitHub ��Trophy on your readme Posted: 02 Sep 2020 05:54 AM PDT
Repository: https://github.com/ryo-ma/github-profile-trophy Please try this! [link] [comments]  |
| [R] We really need to rethink robust losses and optimisation in deep learning! Posted: 02 Sep 2020 05:46 AM PDT |
| [R] Feedbacks on Progressive Self Label Correction Posted: 02 Sep 2020 05:40 AM PDT |
| "Sexpr aren't always superior" Posted: 02 Sep 2020 04:59 AM PDT |
| 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