moab

19 ms·

151.
by moab 7y ago
I find it hard to believe that something deeply insightful can be compressed into 140 characters, or even a collection of tweets. I've read tweet-chains from twitter pundits, and though these longer form tweets do have insight, it&#x27
152.
by moab 7y ago
Delany's writing raises the perennial question of whether we can separate the art from the artist (the view in the current climate seems to be an emphatic "no", see for example the recent Times article about Nolde's pain
153.
by moab 7y ago
Because that's the radicalized ideology that pops up most often on 4chan. If you know of a board with a contingent of alt-left/identity-politics I would be interested to know. As you said yourself, the case of the second shooter s
154.
by moab 7y ago
The "bad" boards frequently leak, and you do see highly political or racist posts from time-to-time on the regular boards. A sign that the community is functioning properly is regulars on /out/, /lit/, etc. ca
155.
by moab 7y ago
I would not lump 4chan into this discussion. I'll concede that some boards on the site are more polemical than others and promote alt-right ideologies without a doubt, but there are many other interesting boards and people on 4chan tha
156.
by moab 7y ago
Hi Richard, What applications/problems are you solving using hypergraphs? There is definitely a dearth of high performance hypergraph processing engines/systems.
157.
by moab 7y ago
Even if the speed is identical to how fast you are thinking of words to type, there are plenty of applications (prevent RSI, accessibility for amputees).
158.
by moab 7y ago
I don't think anyone is trying to be mean/overly critical with their comments here. I hope you keep writing/submitting to HN.
159.
by moab 7y ago
Absolutely agree. Unfortunately this kind of "always optimizing" viewpoint seems to have spread like a virus over this past decade. It is sometimes difficult to remember that spending time to read/understand things slowly is
160.
by moab 7y ago
Here are a few references that solve problems on very large graphs: [1] implements work-efficient parallel algorithms for a list of fundamental graph problems. They report times on a O(200B) edge graph on a single multicore. [2] reports dis
161.
by moab 7y ago
Any insight on why this paper was posted? What graph algorithms are people in the field interested in solving on FPGAs/GPUs/other accelerators? Unfortunately I usually see the same cluster of (toy) problems solved time and again (
162.
by moab 8y ago
Semisorting, and then running a filter to remove duplicates (which will be consecutive after the semisort) can solve this problem in O(n) expected work & space and O(log n) depth w.h.p. AFAIK the approach is reasonably practical as well
163.
What We Owe a Rabbit: Nagel on Animal Ethics(nybooks.com)
1 points by moab 8y ago|0 comments
164.
by moab 8y ago
This very recent paper shows a matching (conditional) lower bound of \Omega(n\log n): https://arxiv.org/abs/1902.10935 (the hardness is from a conjecture in network coding).
165.
by moab 8y ago
Thanks for the reply and the pointer!
166.
by moab 8y ago
I wish the author had explained how he went from identifying that the issue is stalled references to DRAM to the CYCLE_ACTIVITY.STALLS_L3_MISS performance event. Similarly from DRAM_Bound to MEM_LOAD_RETIRED.L3_MISS_PS. My complaint is that
167.
by moab 8y ago
Some fun reading on the topic of long-living light bulbs: https://www.tildedave.com/byron.html Edit: the source is not mentioned anywhere. This is an excerpt from Gravity's Rainbow.
168.
by moab 8y ago
The point of studying data structures and algorithms that you may not use on a day-to-day basis is that they make you learn to think abstractly about problem solving. That is the whole point of getting an undergraduate degree in CS. I'
169.
by moab 8y ago
The same thing could be said for many costly (in terms of either time or money) journeys: hiking the AT, biking across the world, to name two. In these cases, others have made these voyages thousands of times before, but that doesn't s
170.
by moab 8y ago
Another relevant paper on low MLP in this case shared-memory graph algorithms ( http://www.scottbeamer.net/pubs/beamer-iiswc2015.pdf ). It would be interesting to see whether Cimple can significantly improve performance
171.
Cimple: Instruction and Memory Level Parallelism(arxiv.org)
56 points by moab 8y ago|16 comments
172.
New York Review of Books Editor Is Out Amid Uproar Over #MeToo Essay(nyti.ms)
13 points by moab 8y ago|1 comments
173.
Interview with Lenore Blum on CMU Resignation(nextpittsburgh.com)
3 points by moab 8y ago|0 comments
174.
Graph connectivity in log-diameter steps using label propagation(arxiv.org)
1 points by moab 8y ago|0 comments
175.
by moab 8y ago
Really excellent article, thanks for sharing it on HN. The Ralph Towner recording from Solo Concert that the article mentions is also brilliant: https://www.youtube.com/watch?v=e66mkcPsXVo
176.
by moab 8y ago
I think university experiences are bi-modal. If you're going to an essentially unranked university with very poor professors/a non-existent graduate program, you'd probably be better off going to community college and saving
177.
by moab 8y ago
Well, I imagine they use metrics like how many pages you sift through before selecting a link (presumably the page you were looking for), or whether you had to modify the search. As some other posters have said, observing a lift in 1% for t
178.
by moab 8y ago
It's still important to hide latency and saturate the memory controllers for programs with irregular memory accesses (e.g. graph algorithms), although the difference is not 2x, but something more like 10-15% over running without hyper-
179.
by moab 8y ago
You won't have to worry about it if you get them addicted to books from a young age!
180.
by moab 8y ago
Associated paper: https://ipfs.io/ipfs/QmUy4jh5mGNZvLkjies1RWM4YuvJh5o2FYopNPV... Please post any interesting suggestions on bitcoin related papers that appear to have some theoretical content, or present simple ideas

More ›