766 search results - page 142 / 154 » Online Variance Minimization |
ISTCS
1997
Springer
13 years 11 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
Consumers of resources in realistic applications (e.g., web, multimedia) typically derive diminishing-return utilities from the amount of resource they receive. A resource provide...
ICDE
2005
IEEE
14 years 8 months ago
2005
IEEE
We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; th...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...