Sciweavers

1712 search results - page 232 / 343
» A Computational Approach to Binding Theory
Sort
View
MOBIHOC
2006
ACM
16 years 6 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt
IPPS
2007
IEEE
16 years 22 days ago
Storage Optimization for Large-Scale Distributed Stream Processing Systems
We consider storage in an extremely large-scale distributed computer system designed for stream processing applications. In such systems, incoming data and intermediate results ma...
Kirsten Hildrum, Fred Douglis, Joel L. Wolf, Phili...
MOBILITY
2009
ACM
15 years 11 months ago
Context-sensitive authorization in interaction patterns
Main requirement of recent computing environments, like mobile and then ubiquitous computing, is to adapt applications to context. On the other hand, access control generally trus...
Vincent Hourdin, Jean-Yves Tigli, Stephane Lavirot...
ISPAN
1996
IEEE
15 years 10 months ago
Design and evaluation of an environment APE for automatic parallelization of programs
In this paper, we have presented the design and evaluation of a compiler system, called APE,for automatic parallelization of scientific and engineering applications on distributed...
Vipin Chaudhary, Cheng-Zhong Xu, Sumit Roy, Jialin...
TON
2010
109views more  TON 2010»
15 years 4 months ago
Rendered path: range-free localization in anisotropic sensor networks with holes
Sensor positioning is a crucial part of many location-dependent applications that utilize wireless sensor networks (WSNs). Current localization approaches can be divided into two ...
Mo Li, Yunhao Liu