List of Interesting ideas and Views:
- Moonshots for SAP – Where does S/4 HANA drive your company?
- Why Industry 4.0 Matters?
- Deep Learning : Where are we headed?
- Guney Digital Art – TSP Path Algorithm
- Traveling Salesman Problem and Digital Art
- High Altitude Tests Part1
- Quad vs Hexa Copter – Learnings from self making
- This is how my site content looks like …
- New Visual Graph Types
- First Maker Movement Fair in Istanbul – Maker Faire Istanbul
- Going for Low Orbit Space Program !
- SAP Strategy in 2014 and Beyond
- Real Time Data Platform Presentation IDC Big Data Forum 2013
- Winning back the Zero Moment of Truth (ZMOT)
- 50 Times a Second measure and correct: Quad copters and Algorithms
Why Industry 4.0 Matters?
Why Industry revolution 4.0 matters?
Deep Learning : Where are we headed?
I was amazed to see that NVIDIA was just talking about deep learning. I am not here to talk about the differences between Artificial Intelligence or Neural Networks or deep learning, but look a the photo below. NVIDIA CEO on stage and painting his vision for next few years for nvidia. 1- A new GPU and deep learning 2- A very fast box and deep learning 3- Roadmap reveal and deep learning 4- Self-Driving cars...
Guney Digital Art – TSP Path Algorithm
The Original Photo of Guney Candan Back ground removed Thanks to http://www.evilmadscientist.com/ below is the Voronoi Diagram calculated by StippleGen_2 Then after 20 iterations with 3000 dots ductBelow is the TSP path calculated The final V plated end product ! One hand drawing added. This time no software generated view I tried to converting to SVG file Related posts: Art: Pencil Drawn Bora Ugur and Guney Traveling Salesman Problem and Digital Art Coca-Cola Adjust Taste...
Traveling Salesman Problem and Digital Art
Traveling salesman problem: Wikipedia: “The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.” In the mathematics literature, it appears that the first mention of the TSP was...

