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 parallel algorithm on graphic processing units is presented to evaluate an observation sequence on hidden Markov models quickly. The evaluation is compute-intensive when there are thousands of or more Markov models and there are many states in each model. The compute-load can be reduced by the proposed algorithm greatly, but the hardware needed by the algorithm is not so expensive as the other accelerating...
It is compute-intensive to evaluate the probability of an observation sequence on a hidden Markov model. Some fast algorithms exit, the forward-backward procedure is the most popular one among them. The forward-backward procedure can save much computation, but its time complexity is N2T, in other words, there is a high computational complexity in the algorithm. In this paper, we present a parallel...
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.