319
click to vote
FOCM
2016
10 years 1 months ago
2016
Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division. We use cluster ...
157
click to vote
FOCM
2016
10 years 1 months ago
2016
Structured Low-Rank Approximation is a problem arising in a wide range of applications in Numerical Analysis and Engineering Sciences. Given an input matrix M, the goal is to comp...
121
click to vote
FLOPS
2016
Springer
10 years 1 months ago
2016
Springer
Abstract. We present Hakaru, a new probabilistic programming system that allows composable reuse of distributions, queries, and inference algorithms, all expressed in a single lang...
216
click to vote
FLOPS
2016
Springer
10 years 1 months ago
2016
Springer
Computer Science abounds in folktales about how — in the early days of computer programming — bit vectors were ingeniously used to encode and manipulate finite sets. Algorithm...