Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

7 results for “Divide and Conquer”
Set a search alert
Research ArticleOpen accessPhrase in the titleEnsemble Divide and Conquer Approach to Solve the Rating Scores’ Deviation in Recommendation SystemIsmail Ahmed Al-Qasem Al-Hadi, Nurfadhlina Mohd Sharef, Md Nasir Sulaiman, Norwati MustaphaThe rating matrix of a personalized recommendation system contains a high percentage of unknown rating scores which lowers the quality of the prediction. Besides, during data streaming into memory, some rating scores are misplaced from its appropriate cell in the rating matrix which also decrease the quality of the prediction. The singular value decomposition algorithm predicts the unknown rating scores … …Journal of Computer Science, Vol. 12, Issue 6 · 25 Jun 2016 · 7,701 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleComputing ULV Decomposition by Divide Conquer MethodHasan Erbay, Jesse L. BarlowThe ULV decomposition (ULVD) is an important member of a class of rank-revealing two-sided orthogonal decompositions used to approximate the Singular Value Decomposition (SVD). The ULVD can be modified much faster than the SVD. The accurate computation of the subspaces is required in applications in signal processing. In this study we introduce a divide conquer ULVD algorithm. …Journal of Mathematics and Statistics, Vol. 1, Issue 2 · 30 Jun 2005 · 6,434 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA NOVEL HYBRID NODE LOCALIZATION ALGORITHM FOR WIRELESS SENSOR NETWORKSLiu Yu, Wang Haipeng, He You, Shen JianNode self-localization is one of the supporting technologies in Wireless Sensor Networks (WSNs). In this study, a distributed hybrid localization algorithm based on divide-and-conquer and refinement method is proposed. Firstly, the effect of ranging error in the Received Signal Strength (RSS) model on node localization is analyzed and the topology relations of anchors and unknown nodes are derived when the … …Journal of Computer Science, Vol. 9, Issue 12 · 25 Nov 2013 · 6,878 accessesView PDFCite
Research ArticleOpen accessIn the abstractThe Inverse Problem for Boolean EquationsAli Muhammad Ali Rushdi, Hussain Mobarak AlbarakatiThe Forward Problem (FB) of Boolean equations consists of finding solutions of a system of Boolean equations, or equivalently, a single Boolean equation of the form f(X) = 0 where f(X): Bn → B and B is an arbitrary Boolean algebra. By contrast, the Inverse Problem (IB) of Boolean equations aims to reconstruct the equation f (X) = 0 given … …Journal of Computer Science, Vol. 8, Issue 12 · 3 Jan 2013 · 8,353 accessesView PDFCite
Research ArticleOpen accessIn the abstractDynamic Approach to Defend Against Distributed Denial of Service Attacks Using an Adaptive Spin Lock Rate Control MechanismR. Anurekha, K. Duraiswamy, A. Viswanathan et al.Problem statement: The last decade has seen many prominent Distributed Denial of Service (DDoS) attacks on high profile webservers. In this study, we deal with DDoS attacks by proposing a dynamic reactive defense system using an adaptive Spin Lock Rate control (D3SLR). D3SLR identifies malicious traffic flow towards a target system based on the volume of traffic flowing towards the … …Journal of Computer Science, Vol. 8, Issue 5 · 17 Feb 2012 · 7,062 accessesView PDFCite
Research ArticleOpen accessIn the abstractUsing Unique-Prime-Factorization Theorem to Mine Frequent Patterns without Generating TreeHossein Tohidi, Hamidah IbrahimProblem statement: Ffrequent patterns are patterns that appear in a data set frequently. Finding such frequent patterns plays an essential role in mining associations, correlations and many other interesting relationships among data. Approach: Most of the previous studies adopt an Apriorilike approach. For huge database it may need to generate a huge number of candidate sets. An interest solution is … …American Journal of Economics and Business Administration, Vol. 3, Issue 1 · 7 Jan 2011 · 8,839 accessesView PDFCite
Research ArticleOpen accessIn the abstractMining Sequential Access Pattern with Low Support From Large Pre-Processed Web LogsS. Vijayalakshmi, V. MohanProblem statement: To find frequently occurring Sequential patterns from web log file on the basis of minimum support provided. We introduced an efficient strategy for discovering Web usage mining is the application of sequential pattern mining techniques to discover usage patterns from Web data, in order to understand and better serve the needs of Web-based applications. Approach: The approaches adopt … …Journal of Computer Science, Vol. 6, Issue 11 · 23 Oct 2010 · 7,222 accessesView PDFCite