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.
Similarity search is arguably the most important primitive in time series data mining. Recent research has made significant progress on fast algorithms for time series similarity search under Dynamic Time Warping (DTW) and Uniform Scaling (US) distance measures. However, the current state-ofthe-art algorithms cannot support greater amounts of rescaling in many practical applications. In this paper,...
Eigenvalue-based algorithm is generally acknowledged to be a promising method for spectrum sensing. However, it possesses high computational complexity, because the sampled covariance matrix and the corresponding eigenvalues are calculated. Furthermore, the detection performance of eigenvalue-based algorithms experiences a huge decline when the received signals are uncorrelated. Therefore, compressed...
As an intelligent algorithm with the mechanism of positive feedback, the ant colony algorithm is useful in solving the optimal problem. Web service selection is the foundation of the Web service composition which is one of the most important ways to satisfy the users' personalized requirements. Firstly, analyzed the problem of Web service selection based on expounding the basic principle of ant colony...
A novel multi-objective optimization based particle swarm optimization algorithm is presented to solve the global optimization problem for based services selecting in Web services composition technology. This algorithm takes Web services selection as a multi-objective constrained optimization problem with constraints. It introduces multi-objective PSO intelligent theory to optimize multi parameters...
Moving objects detection is a basic task in video analysis and applications. Many algorithms have been proposed to detect moving objects under different situations in the past decades. In this paper, we propose a new method to detect moving objects in a non-stationary, complex background for an automatic traffic monitoring system. As a pre-treatment, the square neighborhood algorithm is adopted to...
Based on the fact that most of the algorithms assume that the camera is fixed and the changing background is learned in the training period, a robust algorithm is proposed for complex background where a shaking camera, changing background and shadows are presented. It combines a new improved mixture of Gaussians model and a square neighborhood matching algorithm to eliminate shadows and reduce false...
Web services composition becomes an ideal choice for enterprise level integration. This paper focuses on the problem of how to select the existed Web services so as to compose a complex service with incomplete QoS information constrains. We first proposed a model of composite service based on Markov process, and then a novel service composition algorithm was designed and implemented, which is built...
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.