-
Voting:
-
-1
+
(*someone*: we're learning NP-hard problems in algo.)
Tushaar: Oooh, what's your favorite NP-hard problem? I like the graph-coloring problem; it's pretty!
Jonathan: Are you talking about your favorite NP-hard problem!? This is the nerdiest conversation I've ever heard!
— Tushaar Gangavarapu,
at a CS 4300 grading session, while in line to get food!
·
March 30, 2023
·
Permalink
-
Voting:
-
-1
+
Maybe we're looking at this all wrong? Maybe, words sit in a dimension where their interactions aren't as complex as we seek them out to be!
— Tushaar Gangavarapu,
in a discussion in CS 6700, on probabilistic modeling
·
March 10, 2023
·
Permalink
-
Voting:
-
-1
+
Don't try to reason with high-dimensional space, anything you can imagine about high-dimensional space is probably wrong!
— Tushaar Gangavarapu,
in CS 4300 review session, in showing why cosine similarity fails in low dimensions and in really high dimensions
·
March 7, 2023
·
Permalink