Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
sharpneli
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
46 ms
·
601.
▲
by
sharpneli
16y ago
"a dynamic range of about 120 dB" Sound of a jackhammer at 1m has sound pressure level of approximately 100dB (relative to 20 uPa). Leaves rustling gently in the wind have sound pressure level about 10dB. If our hearing actually had 120dB d
602.
▲
by
sharpneli
16y ago
The highly recommended classic: http://yudkowsky.net/rational/bayes
603.
▲
by
sharpneli
16y ago
"The majority of people, given the knowledge they had at the time, were likely just doing their job." Please do not take this as an example of Godwin's Law but I think Nuremberg trials made it clear that 'just doing their job' is not an app
604.
▲
by
sharpneli
16y ago
If you can't beat them, join them.
605.
▲
by
sharpneli
16y ago
Me love you long time!
606.
▲
by
sharpneli
16y ago
What stops using multiple passes to render the image? One for primary rays and then invoking another pass for the secondary rays.
607.
▲
by
sharpneli
16y ago
There is extremely glaring factual mistake in this text. "And guess what wave frequency x-ray backscatter machines use? Hint: THz. http://arxiv.org/abs/0910.5294 Sorry. You missed by a multiplier of 10000-10000000. X-rays go from tens of
608.
▲
by
sharpneli
16y ago
True. So for a spherical topology the largest minimum is 5. However for toroidal topology the largest minimum is 6.
609.
▲
by
sharpneli
16y ago
I think I got it now. Don't read this if you are afraid of possible spoiling. We are looking for a graph with highest possible minimum vertice count for any single node. The answer is 6. This graph comes from simply making a hexagonal tilin
610.
▲
by
sharpneli
16y ago
I'd consider that a minor adjustment as it would still essentially be a planar graph (with periodic boundary conditions). Locally both of the cases look identical. Just checked wiki while writing this and toroidal embeddings are a subclass
611.
▲
by
sharpneli
16y ago
"the world is a sphere, and friends don't cross each other." My guess would be that the social graph needs to be planar (e.g embeddable on a plane so that no edges go across eachother). The world is a sphere can be interpreted in too many w