450 search results - page 3 / 90 » Algorithmic uses of the Feferman-Vaught Theorem |
TIT
2002
13 years 7 months ago
2002
Abstract--Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
A recent theorem of Bissacot, et al. proved using results about the cluster expansion in statistical mechanics extends the Lov´asz Local Lemma by weakening the conditions under w...
FOGA
1994
13 years 8 months ago
1994
Holland's Schema Theorem is widely taken to be the foundation for explanations of the power of genetic algorithms (GAs). Yet some dissent has been expressed as to its implica...
NDJFL
2010
13 years 2 months ago
2010
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem ...