Sciweavers

4757 search results - page 172 / 952
» Monads for Functional Programming
Sort
View
HASKELL
2009
ACM
16 years 28 days 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 8 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
JMLR
2012
13 years 8 months ago
A Stick-Breaking Likelihood for Categorical Data Analysis with Latent Gaussian Models
The development of accurate models and efficient algorithms for the analysis of multivariate categorical data are important and longstanding problems in machine learning and compu...
Mohammad Emtiyaz Khan, Shakir Mohamed, Benjamin M....
ITNG
2006
IEEE
16 years 13 days ago
Adding High Level VoIP Facilities to the Unicon Language
Many programming languages have built-in functions for socket programming and data communications. These days, the Internet is widely used for voice communications that employ a V...
Ziad Al-Sharif, Clinton Jeffery