118 search results - page 22 / 24 » Bounds on mutual information for simple codes using informat... |
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
DC
2008
13 years 5 months ago
2008
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
ADHOCNOW
2007
Springer
13 years 11 months ago
2007
Springer
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
BTW
2007
Springer
13 years 11 months ago
2007
Springer
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...
ICFP
2010
ACM
13 years 5 months ago
2010
ACM
We describe the design, implementation, and use of a machinecertified framework for correct compilation and execution of programs in garbage-collected languages. Our framework ext...