The Internet has opened opportunities for efficient on-line trading, and researchers have developed algorithms for various auctions, as well as exchanges for standardized commoditi...
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
Antonio E. Porreca, Giancarlo Mauri, Claudio Zandr...
Abstract— We propose belief propagation (BP) based detection algorithms for the Bell labs layered space-time (BLAST) architectures. We first develop a full complexity BP algorit...
A robust video object segmentation algorithm for complex conditions in surveillance systems is proposed in this paper. This algorithm contains an unsupervised K-Means background c...