SODA
1993
ACM
14 years 23 days ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
ICIP
1995
IEEE
15 years 27 days ago
1995
IEEE
Recently a class of multiscale stochastic models has been introducedin which Gaussian random processes are described by scale-recursive dynamics that are indexed by the nodes of a...