Sciweavers

5056 search results - page 433 / 1012
» Network Coding Theory
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 5 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
POPL
1998
ACM
15 years 9 months ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
SAIG
2000
Springer
15 years 8 months ago
Generating Data Analysis Programs from Statistical Models
Extracting information from data, often also called data analysis, is an important scienti c task. Statistical approaches, which use methods from probability theory and numerical a...
Bernd Fischer 0002, Johann Schumann, Thomas Pressb...
CORR
2008
Springer
157views Education» more  CORR 2008»
15 years 4 months ago
The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
Boris Ryabko
CDC
2008
IEEE
150views Control Systems» more  CDC 2008»
15 years 11 months ago
Robust synchronization in networks of cyclic feedback systems
Abstract— This paper presents a result on the robust synchronization of outputs of statically interconnected non-identical cyclic feedback systems that are used to model, among o...
Abdullah Omar Hamadeh, Guy-Bart Stan, Jorge M. Gon...