455 search results - page 24 / 91 » Distributed Processes on Tree Hash |
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
This work presents a class of unidirectional lifting-based wavelet transforms for an arbitrary communication graph in a wireless sensor network. These transforms are unidirectiona...
SIAMCOMP
1998
13 years 8 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
PPOPP
2011
ACM
12 years 11 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
SIGMOD
2003
ACM
14 years 9 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up t...