Sciweavers

4539 search results - page 836 / 908
» Approaches to Compute Workflow Complexity
Sort
View
148
Voted
IPSN
2007
Springer
15 years 7 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
P2P
2006
IEEE
211views Communications» more  P2P 2006»
15 years 7 months ago
Comparison of Image Similarity Queries in P2P Systems
Given some of the recent advances in Distributed Hash Table (DHT) based Peer-To-Peer (P2P) systems we ask the following questions: Are there applications where unstructured querie...
Wolfgang Müller 0002, P. Oscar Boykin, Nima S...
SPAA
2006
ACM
15 years 7 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
IEEEPACT
2005
IEEE
15 years 7 months ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove
EGC
2005
Springer
15 years 7 months ago
HotGrid: Graduated Access to Grid-Based Science Gateways
Abstract. We describe the idea of a Science Gateway, an applicationspecific task wrapped as a web service, and some examples of these that are being implemented on the US TeraGrid...
Roy Williams, Conrad Steenberg, Julian J. Bunn