10 search results - page 1 / 2 » Near-Optimal Pricing in Near-Linear Time |
WADS
2005
Springer
13 years 10 months ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
DC
2010
13 years 4 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
KDD
2003
ACM
14 years 5 months ago
2003
ACM
Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to mo...
CLUSTER
2009
IEEE
13 years 2 months ago
2009
IEEE
With the advent of high-performance COTS clusters, there is a need for a simple, scalable and faulttolerant parallel programming and execution paradigm. In this paper, we show that...