4 results for “brute-force search”

Set a search alert

Research ArticleOpen accessEvery word in the titleOccurrences Algorithm for String Searching Based on Brute-force AlgorithmAbabneh Mohammad, Oqeili Saleh, Rawan A. AbdeenThis study proposes a string searching algorithm as an improvement of the brute-force searching algorithm. The algorithm is named as, Occurrences algorithm. It is based on performing preprocessing for the pattern and for the text before beginning to search for the pattern in the text. …Journal of Computer Science, Vol. 2, Issue 1 · 31 Jan 2006 · 8,077 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsFirst Token Algorithm for Searching Compound Terms Using Thesaurus DatabaseYousef Abuzir, Thabit SabbahProblem statement: Searching text materials is the one of the most important operations that carried out by search engines either on web or desktop applications, searching algorithms are required sometimes to find a specific word into a text, others to find a multi word term (pattern matching) into a text. Searching for term into a thesaurus database can be carried … …Journal of Computer Science, Vol. 8, Issue 1 · 28 Oct 2011 · 7,946 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsEfficient Processing for Binary Submatrix MatchingAzzam Sleit, Wesam AlMobaideen, Mohammad Qatawneh, Heba SaadehThe heavy demand for large volumes of digital data has increased the interest in matrix-like representation. Matrices are well organized data structures which are suitable to store uniform data in order to simplify data access and manipulation. For several applications, the need is critical to efficiently search for a specific pattern in matrix structures. A pattern can be represented as … …American Journal of Applied Sciences, Vol. 6, Issue 1 · 31 Jan 2009 · 7,616 accessesView PDF Cite

Research ArticleOpen accessIn the abstractEvaluation of Various Compiler Optimization Techniques Related to Mibench Benchmark ApplicationsJeyaraj Andrews, Thangappan SasikalaTuning compiler optimization for a given application of particular computer architecture is not an easy task, because modern computer architecture reaches higher levels of compiler optimization. These modern compilers usually provide a larger number of optimization techniques. By applying all these techniques to a given application degrade the program performance as well as more time consuming. The performance of the … …Journal of Computer Science, Vol. 9, Issue 6 · 6 Jun 2013 · 7,219 accessesView PDF Cite