48 search results - page 3 / 10 » focs 2005 |
92
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically fast...
127
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching p...
154
Voted
TOC
2010
14 years 10 months ago
2010
: We give a simple proof of the OSSS inequality (O'Donnell, Saks, Schramm, Servedio, FOCS 2005). The inequality states that for any decision tree T calculating a Boolean funct...
128
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
117
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
d Abstract] Mikhail Alekhnovich ∗ Subhash A. Khot † Guy Kindler ‡ Nisheeth K. Vishnoi § We show that, unless NP⊆DTIME(2poly log(n) ), the closest vector problem with pre-...