2714 search results - page 200 / 543 » Approximation Schemes for Scheduling |
122
Voted
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...
142
click to vote
SSDBM
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider approximate join processing over data streams when memory limitations cause incoming tuples to overflow the available space, precluding exact processing. Selective evi...
114
click to vote
EGH
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we first present a survey of existing color buffer compression algorithms. After that, we introduce a new scheme based on an exactly reversible color transform, si...
130
click to vote
ICCS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. The results of analytical approximations and extensive calculations based on a path integral Monte Carlo (PIMC) scheme are presented. A new (direct) PIMC method allows fo...
142
click to vote
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...