Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
espeed
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
21 ms
·
511.
▲
Benchmarking RedisGraph 1.0
(redislabs.com)
3 points
by
espeed
8y ago
|
0 comments
512.
▲
SPIRAL: Extreme Performance Portability [pdf]
(users.ece.cmu.edu)
8 points
by
espeed
8y ago
|
0 comments
513.
▲
Notes on Digital Coding – Marcel J. E. Golay (1949) [pdf]
(web.archive.org)
1 points
by
espeed
8y ago
|
0 comments
514.
▲
by
espeed
8y ago
Last month when the spin pieces posted on why WhatsApp Cofounder Brian Acton left, I asked, "Who's submarines [0] are these?"... the contrast in the two articles is telling.... [0] https://news.ycombinator.com/
515.
▲
Schism: A Self-Hosting Scheme to WebAssembly Compiler [video]
(youtube.com)
3 points
by
espeed
8y ago
|
0 comments
516.
▲
Architecting Web Apps – Lights, Camera, Action (The Actor Model) [video]
(youtube.com)
1 points
by
espeed
8y ago
|
0 comments
517.
▲
by
espeed
8y ago
Google announced in the talk that Docker is now working and said to reference this Reddit thread for details... Docker now working https://www.reddit.com/r/Crostini/comments/9jabhq/docker_now...
518.
▲
Chrome OS: Ready for Web Development [video]
(youtube.com)
211 points
by
espeed
8y ago
|
220 comments
519.
▲
by
espeed
8y ago
The posted URL goes to the French version of the page. This is the primary URL: https://aws.amazon.com/corretto/
520.
▲
Not All Patterns, but Enough (2008) [pdf]
(cs.york.ac.uk)
37 points
by
espeed
8y ago
|
1 comments
521.
▲
by
espeed
8y ago
To understand the tradeoffs between LSMs, B-Trees, and Fractal Trees, see the references in this previous post on TokuDB and Bε trees... * BetrFS: An in-kernel file system that uses Bε trees to organize on-disk storage https://ne
522.
▲
25 years ago today, NCSA Mosaic 1.0 was released
(ncsa.illinois.edu)
205 points
by
espeed
8y ago
|
64 comments
523.
▲
by
espeed
8y ago
Does your implementation support vectorized SIMD or SSE instructions?
524.
▲
by
espeed
8y ago
See these two talks by 'hyc... LMDB talk at DEVOXX (2013) [video] https://youtu.be/Rx1-in-a1Xc LMDB CMU Databaseology Lecture (2015) [video] https://youtu.be/tEa5sAh-kVk
525.
▲
Introduction to Fountain Codes: LT Codes with Python
(franpapers.com)
71 points
by
espeed
8y ago
|
11 comments
526.
▲
Data Analysis with Vector Functional Programming (𝝺 Jam 2016) [video]
(youtube.com)
4 points
by
espeed
8y ago
|
0 comments
527.
▲
Visualizing turbulence with a home demo [video]
(youtube.com)
11 points
by
espeed
8y ago
|
2 comments
528.
▲
by
espeed
8y ago
The primary author is Joseph Hellerstein, head of the Berkeley RISELab (the new Spark/AMPLap). Their primary project is called Fluent (which until recently was called Anna [4])...it's the all encompassing name changes that get ya
529.
▲
Ground: A Data Context Service (2017) [pdf]
(rise.cs.berkeley.edu)
46 points
by
espeed
8y ago
|
4 comments
530.
▲
Crit-bit trees
(cr.yp.to)
4 points
by
espeed
8y ago
|
0 comments
531.
▲
by
espeed
8y ago
NB: NB works for me.
532.
▲
Design Review: Key-Value Storage
(mozilla.github.io)
305 points
by
espeed
8y ago
|
85 comments
533.
▲
Vespa – Open Source Big Data Serving Engine [video]
(youtube.com)
3 points
by
espeed
8y ago
|
0 comments
534.
▲
by
espeed
8y ago
I'm not familiar with this particular problem, but can ideas from De Bruijn Sequences be applied? https://en.wikipedia.org/wiki/De_Bruijn_sequence
535.
▲
Trivial Connections on Discrete Surfaces (2010)
(cs.cmu.edu)
6 points
by
espeed
8y ago
|
1 comments
536.
▲
Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra [pdf]
(math.sfsu.edu)
1 points
by
espeed
8y ago
|
0 comments
537.
▲
Birds and Frogs – Freeman Dyson [pdf]
(dept.math.lsa.umich.edu)
3 points
by
espeed
8y ago
|
1 comments
538.
▲
by
espeed
8y ago
If Google Cloud included all Google services (such as Google Search) that run on it as "customers", that would change the numbers a bit.
539.
▲
Direct Methods for Sparse Linear Systems – 42 Lectures by Tim Davis [video]
(youtube.com)
3 points
by
espeed
8y ago
|
0 comments
540.
▲
by
espeed
8y ago
Hi Emil - I don't understand this comment. Last year, the MIT team showed the GraphBLAS/D4M model can achieve 100M inserts per second on a cluster [1], and it's improved since then. The GraphBLAS [2] standard has been in the
More ›