Sciweavers

4224 search results - page 729 / 845
» Reasoning about Choice
Sort
View
ESOP
2012
Springer
13 years 8 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen
POPL
2012
ACM
13 years 8 months ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...
120
Voted
VSTTE
2012
Springer
13 years 8 months ago
Deciding Functional Lists with Sublist Sets
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
Thomas Wies, Marco Muñiz, Viktor Kuncak
120
Voted
JMLR
2012
13 years 3 months ago
Exploiting Unrelated Tasks in Multi-Task Learning
We study the problem of learning a group of principal tasks using a group of auxiliary tasks, unrelated to the principal ones. In many applications, joint learning of unrelated ta...
Bernardino Romera-Paredes, Andreas Argyriou, Nadia...
150
Voted
KDD
2012
ACM
243views Data Mining» more  KDD 2012»
13 years 3 months ago
Storytelling in entity networks to support intelligence analysts
Intelligence analysts grapple with many challenges, chief among them is the need for software support in storytelling, i.e., automatically ‘connecting the dots’ between dispar...
M. Shahriar Hossain, Patrick Butler, Arnold P. Boe...