Sciweavers

STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 11 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
STOC
2004
ACM
145views Algorithms» more  STOC 2004»
14 years 11 months ago
Using mixture models for collaborative filtering
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
Jon M. Kleinberg, Mark Sandler
STOC
2004
ACM
64views Algorithms» more  STOC 2004»
14 years 11 months ago
Low distortion maps between point sets
Claire Kenyon, Yuval Rabani, Alistair Sinclair
STOC
2004
ACM
91views Algorithms» more  STOC 2004»
14 years 11 months ago
A decentralized algorithm for spectral analysis
David Kempe, Frank McSherry
STOC
2004
ACM
73views Algorithms» more  STOC 2004»
14 years 11 months ago
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:
Jonathan A. Kelner
STOC
2004
ACM
98views Algorithms» more  STOC 2004»
14 years 11 months ago
Batch codes and their applications
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
STOC
2004
ACM
86views Algorithms» more  STOC 2004»
14 years 11 months ago
Using nondeterminism to amplify hardness
We revisit the problem of hardness amplification in NP, as recently studied by O'Donnell (STOC `02). We prove that if NP has a balanced function f such that any circuit of si...
Alexander Healy, Salil P. Vadhan, Emanuele Viola
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 11 months ago
Completeness in two-party secure computation: a computational view
Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen