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.
A novel high-resolution inverse synthetic aperture radar (ISAR) imaging method using homotopic non-convex regularization technique is proposed in this paper. Compared with exsiting compressive sensing (CS) based imaging methods, the proposed method can deal well with off-grid scatterers in the imaging scene, besides it has low computational complexity, therefore has potential to be applied in practice...
The path following algorithm was proposed recently to approximately solve the matching problems on undirected graph models and exhibited a state-of-the-art performance on matching accuracy. In this paper, we extend the path following algorithm to the matching problems on directed graph models by proposing a concave relaxation for the problem. Based on the concave and convex relaxations, a series of...
Aiming at the problem that the machine is single and some machine has effect on the processing efficiency in complex product dynamic scheduling, based on the conceptions of bottleneck device classification and increasable bottleneck device, an algorithm which can confirm the increasable bottleneck device is put forward by calculating the total time of parallel operations and by analyzing the number...
Several efficient frequent subgraph mining algorithms have been recently proposed. However, the number of frequent graph patterns generated by these graph mining algorithms may be too large to be effectively explored by users, especially when the support threshold is low. In this paper, we propose to summarize frequent graph patterns by a much smaller number of representative graph patterns. Several...
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.