Sciweavers

3238 search results - page 190 / 648
» On the Computational Interpretation of Negation
Sort
View
ADT
2005
15 years 6 months ago
Bounds on mutual information for simple codes using information combining
For coded transmission over a memoryless channel, two kinds of mutual information are considered: the mutual information between a code symbol and its noisy observation and the ove...
Ingmar Land, Simon Huettinger, Peter A. Hoeher, Jo...
JSYML
2002
92views more  JSYML 2002»
15 years 6 months ago
Groundwork for Weak Analysis
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
António M. Fernandes, Fernando Ferreira
MTA
2002
144views more  MTA 2002»
15 years 6 months ago
Semantic Extraction and Semantics-Based Annotation and Retrieval for Video Databases
Digital video databases have become more pervasive and finding video clips quickly in large databases becomes a major challenge. Due to the nature of video, accessing contents of v...
Yan Liu 0004, Fei Li
TIP
2011
106views more  TIP 2011»
15 years 1 months ago
Practical Bounds on Image Denoising: From Estimation to Information
—Recently, in a previous work, we proposed a way to bound how well any given image can be denoised. The bound was computed directly from the noise-free image that was assumed to ...
Priyam Chatterjee, Peyman Milanfar
FOSSACS
2009
Springer
16 years 1 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...