jinang

Everybody's life has limited success , be happy in others success to get an infinite source of happiness

The amount of sarcasm peaked

Lol

@CricketCentrl Ek baar ke liye Virat kohli ko gussa dila do Par kabhi Suryavanshi ko mat dilana 😂

🚨 ANGRY STATEMENT BY VAIBHAV SURYAVANSHI AFTER HITTING SIXES AGAINST PRAFUL HINGE 🚨 Vaibhav Suryavanshi said 🗣️, "When I got out in the previous match and checked my phone, a lot of things were said about me. When someone says something to me personally, it affects me a bit and I answer with my bat".

🤐🤐

@a_hahahahad Congratulations

woke up today with slightly swollen feet, googled "why" and it says i could be pregnant. say congrats

Someone should get Rituraj Gaikwad's stats before and after the statement "Might be someone from RCB"

My players to watch out for in IPL : obviously Vaibhav Suryavanshi, Brewis, Glenn philips, Virat Kohli, Ayush Matre and Shreyas Iyer

@amritwt We both it isn't :)

joke

one day you wake up and boom the labs stop subsidising tokens which means a subscription is now worth $3k and now you need to write by your hand

@IndianTechGuide Someone should maintain all the JIRA tickets he have raised so far

🚨 "Big brands sell sugary drinks with flashy fruit images, misleading people and fueling rising diabetes and lifestyle issues, especially among kids." - MP Raghav Chadha.

@championswimmer ++ I was also thinking of making something like this

If I get a 100 likes, I'll build this and pay to maintain a server to support this.

@subhashchy Notice period should be a memory file in .claude :)

@a_hahahahad Yo !

time to bring this back.

@NirantK @arpit_bhayani @shobhitic What do you define as large document here?

@arpit_bhayani @shobhitic update: larger documents are less of a problem than they were in 2024 era. context windows are larger, and vectors are now better at "compression" than earlier as well

Say you are building a news aggregator (like Google News). One of the biggest problems you'll face is de-duplicating articles across millions of documents. Naive O(n^2) comparisons will crush you at scale. MinHash + LSH is how you actually solve it. MinHash converts a large set into a small, fixed-size signature, such that the similarity between two signatures approximates the Jaccard similarity of the original sets. Jaccard similarity is simply set intersection divided by set union; a measure of how much two sets overlap. It is a fast, probabilistic way to estimate "how alike are these two documents?" without comparing them word by word. The first step is shingling, where you break each document into overlapping n-grams (say, 3-word sequences), and then run MinHash on that shingle set. MinHash gives you a compact signature, typically 100-200 hash values. The key property is that the probability that two signatures share the same minimum hash value equals the Jaccard similarity of their original shingle sets. This way, you estimate similarity without ever comparing raw text. But you still have the comparison problem. Even with compact signatures, comparing every pair is expensive. That's where LSH (Locality Sensitive Hashing) comes in. You split each signature into b bands of r rows each, and hash each band into a bucket. Two documents that are similar enough will likely land in the same bucket for at least one band, and only those candidate pairs get compared. This approach collapses billions of comparisons down to millions, and it is what systems like Google News and early web crawlers used to deduplicate content at scale. Several Google papers and engineering blogs from the early 2000s reference this exact approach. Pretty simple and neat. As is almost always true at scale, you do not need a perfect similarity detection system. A fast, good-enough one is preferred, given that the cost is ultimately the forcing function.

So I need to work 40 hours per week just to get two extra days to live life. And in those extra two days, I have to skill up because AI could make me unemployed any day.

If you don't believe in yourself , then how other will believe in you?

BREAKING: 🇻🇳 Vietnam officially finds cure for blood cancer - leukemia Due to the urgency of the girl's case, there was no time for lengthy testing. In a hospital in Vietnam, a 12 year old girl was very sick with blood cancer (that's leukemia) The cancer kept coming back, even after strong medicine and a special gift of blood cells from her dad was given to her. Then the doctors decided to try something new called CAR-T treatment. They took some of the girl's own fighter cells ( that's the ones that help fight sickness) out of her blood. They sent those cells to medical scientists in Taiwan. When the cells arrived, these scientist gave the fighter cells a special lock that could find and stick only to the bad cancer cells.They made millions of these fighter cells and put them back into the girl through a little tube in her arm. The fighters then went looking for the cancer, found it, grabbed it, and destroyed it. After some hard days with fever and doctors watching her closely, all the cancer disappeared. She became the first kid in Vietnam to get better this way. When other treatments didn't work, her own body, with a little help, became the hero that saved her. Now other sick kids and even adults alike might have this same chance too. This is an huge breakthrough in the medical world. @mrhighfoster

“We used to review every line of code before it went into production”.

Found it funny

@a_hahahahad Tried to find my similar twt but couldnt. So writing it here. I want to make money so as to buy time and then spend that time with people/ things that make me forget time.

Conversion from dollar to rupee will soon be a easier calculation