453 search results - page 5 / 91 » Tight bounds for the partial-sums problem |
FOCS
2003
IEEE
14 years 20 days ago
2003
IEEE
COLT
2008
Springer
13 years 9 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
IPL
2006
13 years 7 months ago
2006
The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a t...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
IPPS
2005
IEEE
14 years 29 days ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...