The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The ordered tree-to-tree correction problem is to compute the minimum edit cost of transforming one ordered tree to another one. This paper presents a new algorithm for this problem. Given two ordered trees S and T, our algorithm runs in O(|S||T|+min{L 2S |T|+L 2.5S L T ,L 2T |S|+L 2.5T L S ) time, where L S denotes the number...
Given two ordered trees S and T, the tree inclusion problem is to determine whether it is possible to obtain S from T by deleting nodes. Recently, this problem has been recognized as an important primitive in query processing for structured text databases. In this paper we present anO(|leaves(S)||T|) time andO(|leaves(S)|min(depth(T),|leaves(T)|)) space algorithm for ordered tree inclusion, by means...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.