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.
Search engines usually return relevant sorted results based on the keywords. Because of the lack of considering the user's current search interest and intention, this kind of strategy may not meet users' personalized search requirements. In order to retrieve results associated with the user's current search interest, existing researches integrate the user's interest information into the search process...
A fundamental problem in whole sequence matching and subsequence matching is the problem of representation of time series. In the last decade many high level representations of time series have been proposed for data mining which involve a trade-off between accuracy and compactness. In this paper the author proposes a novel time series representation called GMBR based on Minimum Bounding Rectangle...
Software specification is an important element of the software development process. However, in most cases the specifications are out-of-date or even missing. One solution for this kind of problem is to use some process that infers the specification automatically. Work by Ernst et al (2000 ; 2002) has shown how specifications can be generated using program execution traces. These approaches are dependent...
This paper investigates the adequacy of a general form of fitness function, based on a state-based specification, by characterizing the associated search problem and the dynamics of the applied metaheuristic. The measurement approach of the fitness landscape is experimented on various examples and suggests some tuning choices to be made for the metaheuristic considered.
We establish new upper bounds on the complexity of several "rectangle" problems. Our results include, for instance, optimal algorithms for range counting and rectangle searching in two dimensions. These involve linear space implementations of range trees and segment trees. The algorithms we give are simple and practical; they can be dynamized and taken into higher dimensions. Also of interest...
Given a set of points in a d-dimensional space, an orthogonal range query is a request for the number of points in a specified d-dimensional box. We present a data structure and algorithm which enable one to insert and delete points and to perform orthogonal range queries. The worstcase time complexity for n operations is O(n logd n); the space usea is O(n logd-1 n). (O-notation here is with respect...
When selecting from, or sorting, a file stored on a read-only tape and the internal storage is rather limited, several passes of the input tape may be required. We study the relation between the amount of internal storage available and the number of passes required to select the Kth highest of N inputs. We show, for example, that to find the median in two passes requires at least Ω(N1/2) and at most...
A model for searching algorithms is developed which includes most tree-like searching structures such as lists, binary trees, AVL trees and 2, 3-trees. It is shown that no searching algorithm employing a data structure that is uniquely represented (up to isomorphism) can provide search, insert and delete functions all operating faster than c√n time for every n key tree. The c√n bound is shown to be...
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.