Sciweavers

162 search results - page 24 / 33
» Parallel frequent set counting
Sort
View
COORDINATION
2004
Springer
14 years 1 months ago
Probabilistic and Prioritized Data Retrieval in the Linda Coordination Model
Linda tuple spaces are flat and unstructured, in the sense that they do not allow for expressing preferences of tuples; for example, we could be interested in indicating tuples th...
Mario Bravetti, Roberto Gorrieri, Roberto Lucchi, ...
ICDCS
2002
IEEE
14 years 18 days ago
Incremental Replication for Mobility Support in OBIWAN
The need for sharing is well known in a large number of distributed collaborative applications. These applications are difficult to develop for wide area (possibly mobile) networ...
Luís Veiga, Paulo Ferreira
ICDCS
2000
IEEE
14 years 1 days ago
Static and Adaptive Data Replication Algorithms for Fast Information Access in Large Distributed Systems
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
Thanasis Loukopoulos, Ishfaq Ahmad
DCOSS
2009
Springer
13 years 11 months ago
MCP: An Energy-Efficient Code Distribution Protocol for Multi-Application WSNs
In this paper, we study the code distribution problem in multi-application wireless sensor networks (MA-WSNs), i.e., sensor networks that can support multiple applications. While M...
Weijia Li, Youtao Zhang, Bruce Childers
APVIS
2008
13 years 9 months ago
Pixelplexing: Gaining Display Resolution Through Time
Animation is frequently utilized to visually depict change in timevarying data sets. For this task, it is a natural fit. Yet explicit animation is rarely employed for static data....
James Shearer, Michael Ogawa, Kwan-Liu Ma, Toby Ko...