kuya_noel

5 ms·

1.
by kuya_noel 6y ago
earlier studies relate vitamin D deficiency to risk for Acute Respiratory Distress Syndromes in general. the "brandykinin hypothsis" links poor COVID-19 outcomes to vitamin D deficiency as vitamin D is a regulator of the Renin Ang
2.
by kuya_noel 7y ago
Walt Disney Animation Studios | Multiple Roles | Los Angeles, CA | Full Time | Onsite At Walt Disney Animation Studios, technologists and artists work together to advance the art and science of animation. Inspired by our rich legacy, we loo
3.
Raising a seed round as a pregnant minority female founder in blockchain(medium.com)
1 points by kuya_noel 8y ago|0 comments
4.
by kuya_noel 8y ago
i like these two resources: http://bps10.idav.ucdavis.edu/talks/03-fatahalian_gpuArchTer... https://fgiesen.wordpress.com/category/graphics-pipeline/
5.
by kuya_noel 9y ago
what's not realistic with the lemons falling sequence? i link to some examples in other posts below too.
6.
by kuya_noel 9y ago
i wouldn't be able to tell that the chair in the first few seconds of this isn't real: https://www.youtube.com/watch?v=4nKb9hRYbPA on the blue ray dvd of pixar's finding dory, closely examine the sand and wat
7.
by kuya_noel 9y ago
"all models are wrong, but some are useful" i read this discussion as sillysaurus3 arguing the wrongness of ALL models, while not acknowledging dahart's examples of utility: constrained/simplified for some is good enough
8.
by kuya_noel 10y ago
Disney Animation | Interns | Burbank, CA | INTERNS The Walt Disney Animation Studios Technology Department develops software for our animated films like Moana, Zootopia, and Frozen. Software Engineers work closely with production users to c
9.
by kuya_noel 10y ago
here's a cool median filtering algorithm (extensible to bilateral filtering/surface blur) which exhibits O(log r) performance: http://www.shellandslate.com/download/fastmedian_5506.pdf http://www.s
10.
by kuya_noel 17y ago
what about using histograms: a histogram is N bins, where N is the number of values that an integer could assume and each bin stores the count of the number of times that value is seen. assume an integer is 32 bits. 2^32 ~= 4 billion bins