79 search results - page 12 / 16 » stoc 2006 |
STOC
2006
ACM
14 years 10 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
d Abstract] Dana Angluin James Aspnes Jiang Chen Yinghua Wu We propose a new model for exact learning of acyclic circuits using experiments in which chosen values may be assigned ...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...