455 search results - page 24 / 91 » Distributed Processes on Tree Hash |
118
click to vote
ICASSP
2009
IEEE
15 years 8 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...
118
click to vote
SIAMCOMP
1998
15 years 1 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...
154
click to vote
PPOPP
2011
ACM
14 years 4 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...
128
click to vote
SIGMOD
2003
ACM
16 years 2 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 ...
111
click to vote
CORR
2008
Springer
15 years 2 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...