453 search results - page 5 / 91 » Tight bounds for the partial-sums problem |
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
111
click to vote
COLT
2008
Springer
15 years 1 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
14 years 11 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...
191
click to vote
ICDT
2009
ACM
16 years 11 days 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
15 years 5 months 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...