648 search results - page 79 / 130 » Lowness for Demuth Randomness |
KDD
2007
ACM
14 years 11 months ago
2007
ACM
Data mining tasks such as supervised classification can often benefit from a large training dataset. However, in many application domains, privacy concerns can hinder the construc...
DSN
2009
IEEE
14 years 5 months ago
2009
IEEE
Topological worms, such as those that propagate by following links in an overlay network, have the potential to spread faster than traditional random scanning worms because they h...
INFOCOM
2008
IEEE
14 years 5 months ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
SASN
2004
ACM
14 years 4 months ago
2004
ACM
Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Recently, several...
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
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...