5169 search results - page 577 / 1034 » Locality approximation using time |
165
click to vote
AIR
2004
15 years 7 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
226
click to vote
INFOCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
223
click to vote
KDD
2000
ACM
15 years 10 months ago
2000
ACM
Data--call records, internet packet headers, or other transaction records--are coming down a pipe at a ferocious rate, and we need to monitor statistics of the data. There is no r...
214
click to vote
INFOCOM
2005
IEEE
16 years 24 days ago
2005
IEEE
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
289
click to vote
ICDE
2001
IEEE
16 years 8 months ago
2001
IEEE
The management of product-related data in a uniform and consistent way is a big challenge for many manufacturing enterprises, especially the large ones like DaimlerChrysler. So-ca...