Atomic Data’s Post

This is a dataset of plant leaf images in cotyledons and monocotyledons that I took from ornamental plant sellers totaling 1000 images divided into 2 namely, 50 leaf images for cotyledons and 50 leaf images for monocotyledons.

Ah, the classic 'Wait 10 years for a data lake' approach. How cute. Why not just send your data requests via carrier pigeon while we're at it? 🐦💼 Instant access with the Unified Data Library. Because in the time it takes to build that data lake, you could have flown to Mars and back. Twice. #bigdataenergy #39space

In the second episode of our "Did you know" series, HERE developer evangelist Erwin Soekianto will walk you through a tutorial on how to enhance the responses from the HERE Geocoding and Search API by incorporating timezone data. https://t.her.is/3IkWZ9b #geocoder #geocoding #location

Here is an illustration of a latent space, where the points (latent vectors) are represented as small glowing spheres. These vectors encode abstract features of data in a smooth, continuous space. (by adjasting/moving the vector in some directions, one can generate new edited version of old data (new color of original data))

This is pretty neat visualization https://lnkd.in/gMZi5Vb2

Balancing Act: Mastering AVL Tree Rotations 🌳⚖️ Hello tech enthusiasts! Today, we're diving into AVL trees - the self-balancing superstars of the binary search tree world. Let's unpack the rotations that keep these trees efficient. What's an AVL Tree? It's a self-balancing BST where the height difference between left and right subtrees (balance factor) is always -1, 0, or 1. Why Balance Matters: Unbalanced trees can degrade to O(n) operation time. AVL trees maintain O(log n) for insert, delete, and search operations. Key Rotations: 1. Left Rotation 🔄⬅️   When? Right subtree is higher   How? Pivot on the right child, making it the new root 2. Right Rotation 🔄➡️   When? Left subtree is higher   How? Pivot on the left child, making it the new root 3. Left-Right Rotation (Double Rotation) 🔄⬅️➡️   When? Left subtree is higher, but its right child is the culprit   How? Left rotation on left child, then right rotation on root 4. Right-Left Rotation (Double Rotation) 🔄➡️⬅️   When? Right subtree is higher, but its left child is the culprit   How? Right rotation on right child, then left rotation on root Real-world Application: AVL trees are used in database systems where frequent insertions and deletions occur, maintaining fast lookup times. #AVLTrees #DataStructures #BalancedAlgorithms #TechOptimization

Time : O(n*width) Space :O(n)

In the second episode of our "Did you know" series, HERE Developers evangelist Erwin Soekianto will walk you through a tutorial on how to enhance the responses from the HERE Geocoding and Search API by incorporating timezone data. https://t.her.is/3IkWZ9b #geocoder #geocoding #location

In the second episode of our "Did you know" series, HERE Developers evangelist Erwin Soekianto will walk you through a tutorial on how to enhance the responses from the HERE Geocoding and Search API by incorporating timezone data. https://t.her.is/3IkWZ9b #geocoder #geocoding #location

🚀 New Video Alert! 🚀 Excited to share my latest YouTube video on "How to Recover Data Using MARS Agent: Step-by-Step Guide"! 🎥 #MicrosoftAzure #AzureBackup #MARSAgent #DataRecovery #RecoveryServicesVault #CloudComputing #ITTutorial #TechEducation