Sciweavers

2254 search results - page 426 / 451
» Computing the minimal covering set
Sort
View
ICDCS
2006
IEEE
14 years 3 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
NDSS
2006
IEEE
14 years 3 months ago
Software Self-Healing Using Collaborative Application Communities
Software monocultures are usually considered dangerous because their size and uniformity represent the potential for costly and widespread damage. The emerging concept of collabor...
Michael E. Locasto, Stelios Sidiroglou, Angelos D....
PPOPP
2006
ACM
14 years 3 months ago
Exploiting distributed version concurrency in a transactional memory cluster
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...
Kaloian Manassiev, Madalin Mihailescu, Cristiana A...
CLUSTER
2005
IEEE
14 years 3 months ago
Supporting iWARP Compatibility and Features for Regular Network Adapters
With several recent initiatives in the protocol offloading technology present on network adapters, the user market is now distributed amongst various technology levels including r...
Pavan Balaji, Hyun-Wook Jin, Karthikeyan Vaidyanat...
DSN
2005
IEEE
14 years 3 months ago
Checking Array Bound Violation Using Segmentation Hardware
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avo...
Lap-Chung Lam, Tzi-cker Chiueh