Sciweavers

424 search results - page 1 / 85
» Realizability models and implicit complexity
Sort
View
TCS
2011
12 years 11 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
FSTTCS
2005
Springer
13 years 10 months ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann
CVPR
2007
IEEE
14 years 6 months ago
Mapping Natural Image Patches by Explicit and Implicit Manifolds
Image patches are fundamental elements for object modeling and recognition. However, there has not been a panoramic study of the structures of the whole ensemble of natural image ...
Kent Shi, Song Chun Zhu
DSRT
2008
IEEE
13 years 11 months ago
Simulating the Potential Savings of Implicit Energy Management on a City Scale
According to statistics and future prospects in the next few years world-wide energy consumption will increase significantly. Therefore not only more energy efficient technologi...
Doris Zachhuber, Jakob Doppler, Alois Ferscha, Cor...
IV
2005
IEEE
99views Visualization» more  IV 2005»
13 years 10 months ago
Heterogeneous Objects Modelling and Rendering Using Implicit Complexes
This paper describes a technology for modelling and rendering heterogeneous objects containing entities of various dimensionalities within a cellular-functional framework based on...
Elena Kartasheva, Valery Adzhiev, Peter Comninos, ...