Sciweavers

204 search results - page 33 / 41
» A Half-Million Strong at Least
Sort
View
FOCS
2008
IEEE
15 years 4 months ago
Network Extractor Protocols
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...
Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerm...
FOCS
2007
IEEE
15 years 3 months ago
Non-Linear Index Coding Outperforming the Linear Optimum
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
Eyal Lubetzky, Uri Stav
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 3 months ago
Takeover times on scale-free topologies
The topological properties of a network directly impact the flow of information through a system. In evolving populations, the topology of inter-individual interactions affects th...
Joshua L. Payne, Margaret J. Eppstein
TARK
2007
Springer
15 years 3 months ago
Inexact knowledge, margin for error and positive introspection
Williamson (2000a) has argued that positive introspection is incompatible with inexact knowledge. His argument relies on a margin-for-error requirement for inexact knowledge based...
Julien Dutant
INFOCOM
2006
IEEE
15 years 3 months ago
The Internet Dark Matter - on the Missing Links in the AS Connectivity Map
Abstract— The topological structure of the Internet infrastructure is an important and interesting subject that attracted significant research attention in the last few years. A...
Rami Cohen, Danny Raz