2694 search results - page 345 / 539 » Frege's New Science |
185
click to vote
FOCS
2008
IEEE
16 years 29 days ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
165
click to vote
IPPS
2008
IEEE
16 years 28 days ago
2008
IEEE
Volunteer Computing is becoming a new paradigm not only for the Computational Grid, but also for institutions using production-level Data Grids because of the enormous storage pot...
162
click to vote
FOCS
2007
IEEE
16 years 25 days ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
156
click to vote
FOCS
2007
IEEE
16 years 25 days ago
2007
IEEE
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
163
click to vote
FOCS
2007
IEEE
16 years 25 days ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...