Sciweavers

12265 search results - page 16 / 2453
» Knuth-Morris-Pratt Algorithm: An Analysis
Sort
View
AICS
2009
13 years 6 months ago
Robustness Analysis of Model-Based Collaborative Filtering Systems
Collaborative filtering (CF) recommender systems are very popular and successful in commercial application fields. However, robustness analysis research has shown that conventional...
Zunping Cheng, Neil Hurley
JGAA
2007
135views more  JGAA 2007»
13 years 8 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
JCST
2010
189views more  JCST 2010»
13 years 3 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
12 years 11 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park