Sciweavers

1969 search results - page 154 / 394
» Financial Theory 1
Sort
View
FOCS
2003
IEEE
15 years 11 months ago
List-Decoding Using The XOR Lemma
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
Luca Trevisan
PODC
2003
ACM
15 years 11 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 10 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
PODC
2010
ACM
15 years 10 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
NIPS
2001
15 years 7 months ago
Probabilistic principles in unsupervised learning of visual structure: human data and a model
To find out how the representations of structured visual objects depend on the co-occurrence statistics of their constituents, we exposed subjects to a set of composite images wit...
Shimon Edelman, Benjamin P. Hiles, Hwajin Yang, Na...