3958 search results - page 776 / 792 » Dynamic Graph Algorithms with Applications |
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
ICFP
2007
ACM
14 years 9 months ago
2007
ACM
We present a model checker for verifying distributed programs written in the Erlang programming language. Providing a model checker for Erlang is especially rewarding since the la...
PERCOM
2007
ACM
14 years 9 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
PPOPP
2010
ACM
14 years 7 months ago
2010
ACM
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...