Sciweavers

4959 search results - page 216 / 992
» Imperative Functional Programming
Sort
View
HASKELL
2009
ACM
16 years 1 months ago
Types are calling conventions
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
Maximilian C. Bolingbroke, Simon L. Peyton Jones
CAV
2006
Springer
146views Hardware» more  CAV 2006»
15 years 10 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
JMLR
2012
13 years 9 months ago
Sparse Additive Machine
We develop a high dimensional nonparametric classification method named sparse additive machine (SAM), which can be viewed as a functional version of support vector machine (SVM)...
Tuo Zhao, Han Liu
SC
1995
ACM
15 years 10 months ago
Communication Optimizations for Parallel Computing Using Data Access Information
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...
Martin C. Rinard
VEE
2012
ACM
232views Virtualization» more  VEE 2012»
14 years 2 months ago
DVM: towards a datacenter-scale virtual machine
As cloud-based computation becomes increasingly important, providing a general computational interface to support datacenterscale programming has become an imperative research age...
Zhiqiang Ma, Zhonghua Sheng, Lin Gu, Liufei Wen, G...