2095 search results - page 82 / 419 » Improved pebbling bounds |
FOCS
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
VTC
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper, we argue that additional radios should be placed according to the distribution of traffic load in WMN. We show that the capacity of a WMN is constrained by the bottl...
ICCS
2005
Springer
14 years 3 months ago
2005
Springer
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
LATIN
2004
Springer
14 years 3 months ago
2004
Springer
We introduce a new sublinear space data structure—the Count-Min Sketch— for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such a...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensiv...