Did anyone read this paper: neurmorphic computing's yesterday today and tomorrow Computer Science

---

• Did anyone read this paper: neurmorphic computing's yesterday today and tomorrow
• In this blog post we introduce a parallel algorithm, bfsort, based on Bloom Filters, that can sort the array A in O(log n) time and O(m) space where m is the size of: { min, min + 1, min + 2, … , max - 1, max }
• BibSLEIGH — Bibliography of Software Language Engineering in Generated Hypertext
• The tension between convenience and performance in automatic differentiation – Jeffrey M. Siskind

Did anyone read this paper: neurmorphic computing's yesterday today and tomorrow Posted: 05 Dec 2017 11:40 PM PST submitted by /u/trcytony [link] [comments]

In this blog post we introduce a parallel algorithm, bfsort, based on Bloom Filters, that can sort the array A in O(log n) time and O(m) space where m is the size of: { min, min + 1, min + 2, … , max - 1, max } Posted: 05 Dec 2017 03:24 PM PST submitted by /u/gentauro [link] [comments]

BibSLEIGH — Bibliography of Software Language Engineering in Generated Hypertext Posted: 05 Dec 2017 02:09 PM PST submitted by /u/agumonkey [link] [comments]

The tension between convenience and performance in automatic differentiation – Jeffrey M. Siskind Posted: 05 Dec 2017 07:26 AM PST submitted by /u/agumonkey [link] [comments]

You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now.	Email delivery powered by Google
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States