837 search results - page 82 / 168 » Distributed algorithms for reaching consensus on general fun... |
WWW
2004
ACM
14 years 10 months ago
2004
ACM
Centralized Resource Description Framework (RDF) repositories have limitations both in their failure tolerance and in their scalability. Existing Peer-to-Peer (P2P) RDF repositori...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
JMLR
2010
13 years 4 months ago
2010
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
SIAMCOMP
2011
13 years 4 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...