Sciweavers

1496 search results - page 269 / 300
» Definability of Initial Segments
Sort
View
ISCC
2003
IEEE
14 years 3 months ago
Fair Noiseless Broadcast Source Coding
We present a noiseless source coding problem in a broadcast environment and supply a simple solution to this problem. A transmitter wishes to transmit a binary random vector Ò ½...
Serdar Boztas
MFCS
2009
Springer
14 years 2 months ago
Time-Bounded Kolmogorov Complexity and Solovay Functions
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
Rupert Hölzl, Thorsten Kräling, Wolfgang...
ERCIMDL
2001
Springer
205views Education» more  ERCIMDL 2001»
14 years 2 months ago
Building and Indexing a Distributed Multimedia Presentation Archive Using SMIL
This paper proposes an approach to the problem of generating metadata for composite mixed-media digital objects by appropriately combining and exploiting existing knowledge or met...
Jane Hunter, Suzanne Little
STACS
2001
Springer
14 years 2 months ago
Randomness, Computability, and Density
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
VISUALIZATION
1997
IEEE
14 years 2 months ago
Multiresolution compression and reconstruction
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
Oliver G. Staadt, Markus H. Gross, Roger Weber