Sciweavers

10 search results - page 2 / 2
» Underspecified Beta Reduction
Sort
View
TCS
2008
13 years 5 months ago
The weak lambda calculus as a reasonable machine
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
Ugo Dal Lago, Simone Martini
CDES
2006
97views Hardware» more  CDES 2006»
13 years 7 months ago
Protein Secondary Structure Prediction Accuracy versus Reduction Methods
Predicting protein secondary structure is a key step in determining the 3D structure of a protein that determines its function. The Dictionary of Secondary Structure of Proteins (...
Saad Osman Abdalla Subair, Safaai Deris
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 5 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
POPL
2000
ACM
13 years 10 months ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini
CIKM
2008
Springer
13 years 7 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand