Sciweavers

122 search results - page 10 / 25
» Light types for polynomial time computation in lambda-calcul...
Sort
View
FSTTCS
2005
Springer
14 years 1 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
AAAI
2006
13 years 9 months ago
Learning Partially Observable Action Schemas
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
Dafna Shahaf, Eyal Amir
TLCA
2007
Springer
14 years 1 months ago
Predicative Analysis of Feasibility and Diagonalization
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
Jean-Yves Marion
ECCV
2002
Springer
14 years 9 months ago
Assorted Pixels: Multi-sampled Imaging with Structural Models
Abstract. Multi-sampled imaging is a general framework for using pixels on an image detector to simultaneously sample multiple dimensions of imaging (space, time, spectrum, brightn...
Shree K. Nayar, Srinivasa G. Narasimhan
CVPR
1999
IEEE
1071views Computer Vision» more  CVPR 1999»
14 years 9 months ago
Adaptive Background Mixture Models for Real-Time Tracking
A common method for real-time segmentation of moving regions in image sequences involves "background subtraction," or thresholding the error between an estimate of the i...
Chris Stauffer, W. Eric L. Grimson