Sciweavers

4403 search results - page 606 / 881
» Galois Theory of Algorithms
Sort
View
FOCS
2002
IEEE
16 years 12 days ago
Learning Intersections and Thresholds of Halfspaces
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
193
Voted
SIGECOM
2010
ACM
149views ECommerce» more  SIGECOM 2010»
16 years 7 days ago
A new understanding of prediction markets via no-regret learning
We explore the striking mathematical connections that exist between market scoring rules, cost function based prediction markets, and no-regret learning. We first show that any c...
Yiling Chen, Jennifer Wortman Vaughan
191
Voted
SIGECOM
2010
ACM
147views ECommerce» more  SIGECOM 2010»
16 years 7 days ago
Socially desirable approximations for Dodgson's voting rule
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
Ioannis Caragiannis, Christos Kaklamanis, Nikos Ka...
217
Voted
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
16 years 7 days ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
260
Voted
FOCS
2000
IEEE
15 years 12 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk