200
click to vote
FOIKS
2016
Springer
10 years 13 hour ago
2016
Springer
The ability of an agent to make quick, rational decisions in an uncertain environment is paramount for its applicability in realistic settings. Markov Decision Processes (MDP) prov...
347
click to vote
FOCM
2016
10 years 13 hour ago
2016
We give necessary and sufficient conditions in terms of sign vectors for the injectivity of families of polynomial maps with arbitrary real exponents defined on the positive orth...
329
click to vote
FOCM
2016
10 years 13 hour ago
2016
The method of alternating projections is a classical tool to solve feasibility problems. Here we prove local convergence of alternating projections between subanalytic sets A, B u...
353
click to vote
FOCM
2016
10 years 13 hour ago
2016
We rigorously study a novel type of trigonometric Fourier collocation methods for solving multi-frequency oscillatory second-order ordinary differential equations (ODEs) q (t) + M...
301
click to vote
FOCM
2016
10 years 13 hour 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 ...
146
click to vote
FOCM
2016
10 years 13 hour 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...
110
click to vote
FLOPS
2016
Springer
10 years 13 hour 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...
199
click to vote
FLOPS
2016
Springer
10 years 13 hour 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...
113
click to vote
FLOPS
2016
Springer
10 years 13 hour ago
2016
Springer
Resolution lies at the foundation of both logic programming and type class context reduction in functional languages. Terminating derivations by resolution have well-defined induc...