Sciweavers

1060 search results - page 134 / 212
» Notes on Coding Theory
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 4 months ago
Primitive words and roots of words
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
Gerhard Lischke
WWW
2004
ACM
15 years 10 months ago
Sic transit gloria telae: towards an understanding of the web's decay
The rapid growth of the web has been noted and tracked extensively. Recent studies have however documented the dual phenomenon: web pages have small half lives, and thus the web e...
Ziv Bar-Yossef, Andrei Z. Broder, Ravi Kumar, Andr...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
15 years 10 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
15 years 10 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
GECCO
2004
Springer
179views Optimization» more  GECCO 2004»
15 years 3 months ago
An Evolutionary Meta Hierarchical Scheduler for the Linux Operating System
Abstract. The need for supporting CSCW applications with heterogeneous and varying user requirements calls for adaptive and reconfigurable schedulers accommodating a mixture of re...
Horst Wedde, Muddassar Farooq, Mario Lischka