541 search results - page 37 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
ICA
2012
Springer
12 years 4 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
ICANNGA
2009
Springer
14 years 1 months ago
2009
Springer
The problem we address in this paper is that of finding effective and parsimonious patterns of connectivity in sparse associative memories. This problem must be addressed in real n...
WWW
2008
ACM
13 years 8 months ago
2008
ACM
As the Internet continues to play an important role in many business applications, it becomes vital to increase the competitive edge by offering geographically tailored contents t...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Finding Contiguous Sequential Patterns (CSP) is an important problem in Web usage mining. In this paper we propose a new data structure, UpDown Tree, for CSP mining. An UpDown Tre...
AISS
2010
13 years 6 months ago
2010
The migration method of a mobile agent affects the entire performance of the distributed system. Most of the existing migration methods have the slow-witted structures due to the ...