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.
Given a query string and a collection of strings, the top-k string similarity search is to find the k most similar strings in the collection to the query string based on edit distance. Most existing works have focused on a filter-and-verify framework to prune non-candidates with some lower bounds of edit distance. The best current implementations require more than 10 seconds answering a top-40 query...
With the rapid development of GPS devices, satellite and wireless communications technologies, many trajectory data is generated. Consequently, processing and analyzing trajectory data have become a hot topic. In this paper, an improved noise filtering, trajectory compression and trajectory segmentation method based on Kalman filter and Douglas-Peucker algorithm and corner is proposed. Firstly, the...
Among the many-objective optimization problems, there exists a kind of problem with redundant objectives, it is possible to design effective algorithms by removing the redundant objectives and keeping the non-redundant objectives so that the original problem becomes the one with much fewer objectives. In this paper, a new non-redundant objective set generation algorithm is proposed. To do so, first,...
Graphs are popular models for representing complex structure data and similarity search for graphs has become a fundamental research problem. Many techniques have been proposed to support similarity search based on the graph edit distance. However, they all suffer from certain drawbacks: high computational complexity, poor scalability in terms of database size, or not taking full advantage of indexes...
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.