Sciweavers

4324 search results - page 279 / 865
» A Generalized Representer Theorem
Sort
View
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
15 years 10 months ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel
CORR
2006
Springer
110views Education» more  CORR 2006»
15 years 6 months ago
On Multistage Successive Refinement for Wyner-Ziv Source Coding with Degraded Side Informations
We provide a complete characterization of the rate-distortion region for the multistage successive refinement of the Wyner-Ziv source coding problem with degraded side information...
Chao Tian, Suhas N. Diggavi
ALMOB
2006
110views more  ALMOB 2006»
15 years 6 months ago
Computing distribution of scale independent motifs in biological sequences
The use of Chaos Game Representation (CGR) or its generalization, Universal Sequence Maps (USM), to describe the distribution of biological sequences has been found objectionable ...
Jonas S. Almeida, Susana Vinga
TPHOL
2009
IEEE
16 years 1 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
RTA
2005
Springer
16 years 4 days ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner