2200 search results - page 363 / 440 » Bloch's Constant is Computable |
166
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
168
click to vote
PDCN
2004
15 years 7 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
137
click to vote
APAL
2010
15 years 6 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
180
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
186
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: The simulation of metabolic networks in quantitative systems biology requires the assignment of enzymatic kinetic parameters. Experimentally determined values are ofte...