An Incremental Unique Representation for Regular Trees
نویسنده
چکیده
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way that their representation is unique and shares substructures as much as possible. This maximal sharing allows substantial memory gain and speed up over previous techniques. For example, equality testing becomes constant time (instead of O(n log(n))). The algorithms are incremental, and as such allow good reactive behavior. These new algorithms are then applied in a representation of sets of trees. The expressive power of this new representation is exactly what is needed by the original set-based analyses of Heintze and Jaffar [1990], or Heintze [1994]. CR Classification: See Computing Revues
منابع مشابه
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way that their representation is unique and shares as much as possible. This maximal sharing allows substantial memory gain and speed up. For example, equality testing becomes constant time. The algorithms are incremental, ...
متن کاملA Simplified Modal Pushover Analysis-based Method for Incremental Dynamic Analysis of Regular RC Moment-resisting Frames
Incremental Dynamic Analysis (IDA) procedure is now considered as a robust tool for estimating the seismic sidesway collapse capacity of structures. However, the procedure is time-consuming and requires numerous nonlinear response-history analyses. This paper proposes a simplified Modal Pushover Analysis (MPA) procedure for IDA of RC moment-resisting frames. The proposed method uses the dynamic...
متن کاملA New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملDistinguished positive regular representations
Let $G$ be a tamely ramified reductive $p$-adic group. We study distinction of a class of irreducible admissible representations of $G$ by the group of fixed points $H$ of an involution of $G$. The representations correspond to $G$-conjugacy classes of pairs $(T,phi)$, where $T$ is a tamely ramified maximal torus of $G$ and $phi$ is a quasicharacter of $T$ whose restriction t...
متن کاملApproximation of fixed points for a continuous representation of nonexpansive mappings in Hilbert spaces
This paper introduces an implicit scheme for a continuous representation of nonexpansive mappings on a closed convex subset of a Hilbert space with respect to a sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup. The main result is to prove the strong convergence of the proposed implicit scheme to the unique solutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Nord. J. Comput.
دوره 7 شماره
صفحات -
تاریخ انتشار 2000