2084 search results - page 340 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
MIDDLEWARE
2007
Springer
15 years 3 months ago
2007
Springer
Distributed computations, dealing with large amounts of data, are scheduled in Grid clusters today using either a task-centric mechanism, or a worker-centric mechanism. Because of ...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
A real-time system must execute functionally correct computations in a timely manner. In order to guarantee that all tasks accepted in the system will meet their timing requiremen...
TSP
2008
14 years 9 months ago
2008
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
130
click to vote
SIAMMAX
2010
14 years 4 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...