Sciweavers

687 search results - page 14 / 138
» Feature (De)composition in Functional Programming
Sort
View
ENTCS
2007
101views more  ENTCS 2007»
13 years 7 months ago
From Functional Programs to Interaction Nets via the Rewriting Calculus
We use the ρ-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the ρ-terms arising fro...
Horatiu Cirstea, Germain Faure, Maribel Fern&aacut...
BMCBI
2006
127views more  BMCBI 2006»
13 years 7 months ago
Automatic discovery of cross-family sequence features associated with protein function
Background: Methods for predicting protein function directly from amino acid sequences are useful tools in the study of uncharacterised protein families and in comparative genomic...
Markus Brameier, Josien Haan, Andrea Krings, Rober...
ICFP
2007
ACM
14 years 7 months ago
Call-pattern specialisation for haskell programs
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...
Simon L. Peyton Jones
JMLR
2012
11 years 10 months ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee
KES
2005
Springer
14 years 1 months ago
Uncertainty Management in Logic Programming: Simple and Effective Top-Down Query Answering
We present a simple, yet general top-down query answering procedure for logic programs managing uncertainty. The main features are: (i) the certainty values are taken from a certai...
Umberto Straccia