Sciweavers

1517 search results - page 241 / 304
» Time and Location Based Services with Access Control
Sort
View
PLDI
2010
ACM
15 years 7 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
SDM
2008
SIAM
129views Data Mining» more  SDM 2008»
14 years 11 months ago
Statistical Density Prediction in Traffic Networks
Recently, modern tracking methods started to allow capturing the position of massive numbers of moving objects. Given this information, it is possible to analyze and predict the t...
Hans-Peter Kriegel, Matthias Renz, Matthias Schube...
SACMAT
2009
ACM
15 years 4 months ago
A decision support system for secure information sharing
In both the commercial and defense sectors a compelling need is emerging for highly dynamic, yet risk optimized, sharing of information across traditional organizational boundarie...
Achille Fokoue, Mudhakar Srivatsa, Pankaj Rohatgi,...
DATE
2009
IEEE
121views Hardware» more  DATE 2009»
15 years 4 months ago
Remote measurement of local oscillator drifts in FlexRay networks
—Distributed systems, especially time-triggered ones, are implementing clock synchronization algorithms to provide and maintain a common view of time among the different nodes. S...
Eric Armengaud, Andreas Steininger
IPPS
2007
IEEE
15 years 4 months ago
A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
Samee Ullah Khan, Ishfaq Ahmad