4,258 karma · joined July 8, 2010
Most of the time you don't, but sometimes you get lucky. When Neil Clarke had his "widowmaker" heart attack he was at a conference down the street from a hospital[0]. In another case, an new father suffered an aortic dissection walking in the front door of Brigham and Women's Hospital[1].
[0] http://neil-clarke.com/the-day-it-nearly-ended/ [1] https://bwhpublicationsarchives.org/DisplayBulletin.aspx?art...
Planar graphs do not embed K5 (the complete graph with five nodes) or K3,3 (the complete bipartite graph with three nodes on each side). You can get a brief overview of planarity testing algorithms here: https://en.m.wikipedia.org/wiki/Planarity_testing
> Also, methods to transform any graph into a planar graph with some cost function?
Do you mean an algorithm that finds a planar subgraph while optimizing some cost? Sounds interesting, but it's not something I've ever explored.
SRTMv3 is 30m/px covering latitudes ±60. The earliest release was 90m/px. There was also release that was 30m within the United States and 90m elsewhere.
> steep grazing angles from the radar not generating much shadow
Mountain shadows are actually a problem! Some releases contain voids where there was no radar return, particularly around the Himalayas. There's a body of publications on void filling the SRTM data, if you're interested.
Well that's a whole lot of nonsense. Holding out a hash function as secure while providing no analysis is laughable.
Last week I burned my server to the ground and we all migrated to a self-hosted matrix instance.
It must've been posted here before: this is exactly the strategy Andy Sloane used to localize his car.
That's not true. It's been very useful for funding the DPRK nuclear program through ransoms.
Compared to transit, last mile bandwidth is effectively limitless and free. Cache fill at the edge is important, last mile caching not so much.
https://uscode.house.gov/view.xhtml?path=/prelim@title43/cha...
https://www.slac.stanford.edu/vault/pubvault/news19701971/sl...