Sciweavers

49 search results - page 4 / 10
» Is There an Elegant Universal Theory of Prediction
Sort
View
ICCV
2011
IEEE
12 years 5 months ago
Learning Universal Multi-view Age Estimator by Video Contexts
Most existing techniques for analyzing face images assume that the faces are at near-frontal poses. Generalizing to non-frontal faces is often difficult, due to a dearth of groun...
Zheng Song, Bingbing Ni, Dong Guo, Terence Sim, Sh...
JCSS
2006
77views more  JCSS 2006»
13 years 5 months ago
Sequential predictions based on algorithmic complexity
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
Marcus Hutter
POPL
2012
ACM
12 years 1 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
CADE
1998
Springer
13 years 10 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary
ENTCS
2008
91views more  ENTCS 2008»
13 years 5 months ago
A Name Abstraction Functor for Named Sets
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
Vincenzo Ciancia, Ugo Montanari