aduffy

16 ms·

181.
by aduffy 10y ago
Great, just another thing I need to delete
182.
Scala Collections: Why Not?(youtube.com)
2 points by aduffy 10y ago|0 comments
183.
by aduffy 10y ago
My favorite: the new `object` type. Non-nullable and cannot refer to primitives.
184.
by aduffy 10y ago
The slide is taken very hard out of context, which is easy to see if you scroll one slide to the left. It's a commentary on how the software industry as changed as a whole since the suit and tie era. The rest of the deck, however, cree
185.
Open Source Software at Dropbox(dropbox.com)
2 points by aduffy 10y ago|0 comments
186.
by aduffy 10y ago
Do you have any details on your experience training the models? Was this using vanilla RNNs, LSTM cells, did you use an attention mechanism, etc.? How long did you train for?
187.
The Macedonian Teens Who Mastered Fake News(wired.com)
3 points by aduffy 10y ago|0 comments
188.
Learning Rust with Entirely Too Many Linked Lists(cglab.ca)
2 points by aduffy 10y ago|0 comments
189.
by aduffy 10y ago
Interestingly enough, this code is replicated in Scala Native as an example for use of the language superset[1]. [1] https://github.com/scala-native/scala-native-example/blob/ma...
190.
Russia Charges Kaspersky Lab Employee and Agents with Treason(abc.net.au)
2 points by aduffy 10y ago|0 comments
191.
by aduffy 10y ago
-Xverbose:class JVM arg could also have sufficed in case you don't want to use strace.
192.
by aduffy 10y ago
Are they simply taking this out of beta? I've been using paper for over a year now, it's a lot like Quip but integrated with Dropbox
193.
by aduffy 10y ago
You can now have a website secured by a certificate issued by a Google CA, hosted on Google web infrastructure, with a domain registered using Google Domains, resolved using Google Public DNS, going over Google Fiber, in Google Chrome on a
194.
Stanford Probabilistic Graphical Models Lecture Notes(ermongroup.github.io)
3 points by aduffy 10y ago|0 comments
195.
Internet Quantitative Social Science: Insights from a Trillion Observations(arxiv.org)
3 points by aduffy 10y ago|0 comments
196.
Neural Networks for Face Recognition(cs.cmu.edu)
4 points by aduffy 10y ago|0 comments
197.
Ohana: Uber iOS Contacts Library(eng.uber.com)
1 points by aduffy 10y ago|0 comments
198.
Edward: A library for probabilistic modeling, inference, and criticism(edwardlib.org)
2 points by aduffy 10y ago|0 comments
199.
by aduffy 10y ago
The Algorithm Design Manual by Skiena. Each section contains a story of some situation he was in where he faced a problem which he solved by applying one of various algo techniques (DP, divide and conquer, etc.). After reading CLRS for a cl
200.
by aduffy 10y ago
If you maintain a large open source project during work hours then that arguably is "sponsorship". Looking at the Keras commit log it seems he pushes frequently.
201.
Here I Am Again, My Friends! (Guccifer 2.0)(guccifer2.wordpress.com)
1 points by aduffy 10y ago|0 comments
202.
by aduffy 10y ago
Cool, it smelled like MC :)
203.
by aduffy 10y ago
Curious if the poorly written prose was generated by AI or a person. Funny stuff though!
204.
by aduffy 10y ago
The difference is that it's not dealt with entirely in the compile phase. i.e. language features that are checked at compilation and known to be true that are not needed at runtime. The Haskell `newtype` example I gave was meant to i
205.
by aduffy 10y ago
This is actually a very helpful comment. I used to think "zero-cost" meant "at compile-time", as in `newtype` in Haskell, etc. I'm guessing that's what the parent commenter thought as well, and I'd guess i
206.
by aduffy 10y ago
Not exactly a book, but Yale CS hosts a set of notes from a course of theirs, almost 500 pages. http://cs-www.cs.yale.edu/homes/aspnes/classes/465/notes.pdf
207.
Why Spinlocks Are Bad on iOS(blog.postmates.com)
2 points by aduffy 10y ago|0 comments
208.
by aduffy 10y ago
I wrote the comment before the parent made their edit so the logic did match what it was at the time. Having said that it would've been a very simple extension to make it a recursive algorithm which includes the else case, and arguably
209.
by aduffy 10y ago
With Haskell this isn't an issue because lists are evaluated lazily, but what I was trying to get at and failed to make clear was that other languages which allow functional-like behavior can result in unnecessary allocation. For examp
210.
by aduffy 10y ago
I could imagine the above being expressed very concisely and elegantly in a language like Haskell: f = sum $ map (\x -> if x == 'a' then 2 else 0) I tend to think that as the accumulation condition gets more complicate

More ›