Sciweavers

SODA
1993
ACM
118views Algorithms» more  SODA 1993»
13 years 5 months ago
Scapegoat Trees
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...
Igal Galperin, Ronald L. Rivest
ICIP
1995
IEEE
14 years 5 months ago
Multiresolution model development for overlapping trees via canonical correlation analysis
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...
Paul W. Fieguth, William W. Irving, Alan S. Willsk...