List of Interesting ideas and Views:
- Creating a mash up between SAP HANA and SAP ERP using Visual Composer
- Transforming BI for Extreme DATA–Why is it relevant for Today? Why Today? IDC Business Intelligence Roadshow 2011
- Gamification of eEducation System: Where should we start?
- in-memory Database: Why is it relevant for Today? Why Today?
- Real SAP HANA Customer Performance Test Case I (from Turkey)
- Can Oscar Pistorius or His Next Versions Beat Able-Bodied?
- 100% Open Source Project from Mick Ebeling – The EyeWriter
- Ubuntu Natty Installation with Remote Desktop Access from Windows with Nomachine at Amazon AWS Cloud for Free
- Video: Evolution of A New Architecture SAP HANA
- See How SAP co-CEO Bill uses his iPAD for Analysing Real SAP data in Real Time
- What is SAP HANA? Why is SAP HANA a Game Changer? What Drives in-memory Computing?
- In-memory Database Systems: Hype or Reality?
- SAP Hana: Details of High Performance Analytical Appliance
- Next Generation InfoGraphics
- What is Information?
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...