7006 search results - page 387 / 1402 » Approximation Algorithms |
128
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
136
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
148
click to vote
SSDBM
2003
IEEE
15 years 10 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
257
click to vote
POPL
2007
ACM
16 years 5 months ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
240
Voted
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...