Heykuki News
Top
New
Best
Ask
Show
Jobs
Toggle theme
Login
Top
New
Best
Ask
Show
Jobs
1.
▲
Classical data structures that can outperform learned indexes (2018)
(dawn.cs.stanford.edu)
252 points
signa11
5 years ago
39 comments
2.
▲
DAWN: Tools for AI and Data Product Development
(dawn.cs.stanford.edu)
215 points
indescions_2017
8 years ago
14 comments
3.
▲
Classical Data Structures That Can Outperform Learned Indexes
(dawn.cs.stanford.edu)
139 points
chmaynard
8 years ago
20 comments
4.
▲
HALP: High-Accuracy Low-Precision Training
(dawn.cs.stanford.edu)
103 points
chmaynard
8 years ago
11 comments
5.
▲
Filter Before You Parse: Faster Analytics on Raw Data with Sparser
(dawn.cs.stanford.edu)
86 points
bandwitch
8 years ago
14 comments
6.
▲
Implementing a Fast Research Compiler in Rust
(dawn.cs.stanford.edu)
72 points
fabuzaid
9 years ago
3 comments
7.
▲
Why Train What You Can Code? Rekall: A Compositional Approach to Video Analysis
(dawn.cs.stanford.edu)
7 points
danfu09
7 years ago
discuss
8.
▲
Moment-based quantile sketches for efficient aggregation
(dawn.cs.stanford.edu)
6 points
matt_d
8 years ago
2 comments
9.
▲
Stanford DAWN Project
(dawn.cs.stanford.edu)
6 points
pramodbiligiri
9 years ago
discuss
10.
▲
Classical Data Structures That Can Outperform Learned Indexes
(dawn.cs.stanford.edu)
5 points
todsacerdoti
5 years ago
discuss
11.
▲
New high score on GLUE mixes transfer learning/MTL/weak supervision/ensembling
(dawn.cs.stanford.edu)
5 points
bradenjh
7 years ago
discuss
12.
▲
Optimizing Data-Intensive Computations in Existing Libraries w/Split Annotations
(dawn.cs.stanford.edu)
4 points
matt_d
7 years ago
discuss
13.
▲
DAWNBench v1 Deep Learning Benchmark Results
(dawn.cs.stanford.edu)
4 points
mateiz
8 years ago
discuss
14.
▲
Willump: Statistical Optimizations for Fast ML Feature Computation
(dawn.cs.stanford.edu)
3 points
KraftyOne
6 years ago
discuss
15.
▲
Moment-based quantile sketches for efficient aggregation
(dawn.cs.stanford.edu)
3 points
fangjin
8 years ago
discuss
16.
▲
Stanford DAWN Deep Learning Benchmark (DAWNBench)
(dawn.cs.stanford.edu)
3 points
jonbaer
8 years ago
discuss
17.
▲
DAWNBench: An End-To-End Deep Learning Benchmark and Competition
(dawn.cs.stanford.edu)
3 points
stablemap
8 years ago
discuss
18.
▲
Classical data structures that can outperform learned indexes
(dawn.cs.stanford.edu)
2 points
fanf2
2 years ago
discuss
19.
▲
A Statistically-Aware End-to-End Optimizer for Machine Learning Inference
(dawn.cs.stanford.edu)
2 points
mikepetridisz
7 years ago
discuss
20.
▲
Model Assertions as a Tool for Quality Assurance and Improving ML Models
(dawn.cs.stanford.edu)
2 points
mrbbk
7 years ago
discuss
21.
▲
Moment-based quantile sketches for efficient aggregation
(dawn.cs.stanford.edu)
2 points
fangjin
8 years ago
discuss
22.
▲
Earthquake Hunting with Efficient Time Series Similarity Search
(dawn.cs.stanford.edu)
2 points
chmaynard
8 years ago
discuss
23.
▲
Google TPU outperforms competition on ImageNet training performance benchmark
(dawn.cs.stanford.edu)
2 points
theCricketer
8 years ago
discuss
24.
▲
DAWNBench – Stanford Deep Learning Benchmark
(dawn.cs.stanford.edu)
2 points
jonbaer
8 years ago
discuss
25.
▲
Weak Supervision: The New Programming Paradigm for Machine Learning
(dawn.cs.stanford.edu)
2 points
brandonb
9 years ago
discuss
26.
▲
Automatic Time Series Smoothing with ASAP – Stanford DAWN
(dawn.cs.stanford.edu)
2 points
jasondavies
9 years ago
discuss
27.
▲
Optimizing Data-Intensive Computations with Split Annotations
(dawn.cs.stanford.edu)
1 point
QuitterStrip
7 years ago
discuss
28.
▲
Moment-based quantile sketches for efficient aggregation
(dawn.cs.stanford.edu)
1 point
fangjin
8 years ago
discuss
29.
▲
Moment-based quantile sketches for efficient aggregation
(dawn.cs.stanford.edu)
1 point
fangjin
8 years ago
discuss
30.
▲
Moment-based quantile sketches for efficient aggregation
(dawn.cs.stanford.edu)
1 point
fangjin
8 years ago
discuss
More