360 search results - page 36 / 72 » Distributed Network Querying with Bounded Approximate Cachin... |
157
Voted
INFOCOM
2006
IEEE
15 years 9 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...
161
Voted
ICDE
2011
IEEE
14 years 7 months ago
2011
IEEE
—When users submit new queries to a distributed stream processing system (DSPS), a query planner must allocate physical resources, such as CPU cores, memory and network bandwidth...
160
Voted
ICDCS
2006
IEEE
15 years 9 months ago
2006
IEEE
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of ne...
130
Voted
SRDS
1999
IEEE
15 years 8 months ago
1999
IEEE
Numerous mathematical approaches have been proposed to determine the optimal checkpoint interval for minimizing total execution time of an application in the presence of failures....
152
Voted
SACMAT
2006
ACM
15 years 9 months ago
2006
ACM
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...