18090 search results - page 3220 / 3618 » Computing by Only Observing |
180
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
237
click to vote
P2P
2008
IEEE
16 years 1 months ago
2008
IEEE
IgorFs is a distributed, decentralized peer-to-peer (P2P) file system that is completely transparent to the user. It is built on top of the Igor peer-to-peer overlay network, whi...
200
click to vote
COMPGEOM
2006
ACM
16 years 22 days ago
2006
ACM
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
171
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
178
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...