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

18 results for “Binary Tree”
Set a search alert
Research ArticleOpen accessPhrase in the titleSurvival Analysis of Data of HIV Infected Persons Receiving Antiretroviral Therapy Using a Model-Based Binary Tree ApproachSimon Tiendrébéogo, Blaise Somé, Séni Kouanda, Simplice Dossou-GbétéDiscrete-time approach is used in survival data analysis when only the time interval in which the event of interest has occurred is known or when this event occurs in a discrete - time scale. The work presented in this paper is motivated by the analysis of HIV/AIDS follow-up data collected in Burkina Faso during the 5-YEAR Global Fund program implemented … …Journal of Mathematics and Statistics, Vol. 15, Issue 1 · 24 Dec 2019 · 6,495 accessesView PDFCite
Research ArticleOpen accessPhrase in the titlePrivacy Preservation for File Sharing Scheme Using Secured File Block ID with Binary TreesM. Balamurugan, S. Chenthur Pandian, J. BhuvanaPrivacy, the security of information from unauthorized access is gradually needed on the Internet and yet progressively more important while each user acts as both consumer and producer. The lack of privacy is mainly employed for peer-to peer file sharing applications, in which users in the network shared file with each other and their actions are easily monitored by the … …American Journal of Applied Sciences, Vol. 10, Issue 1 · 1 Jan 2013 · 6,928 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleA Block Cipher Algorithm for Multimedia Content Protection with Random Substitution using Binary Tree TraversalP. Vidhya Saraswathi, M. VenkatesuluMany people consume multimedia content (images, music, movie) on portable devices like DVD player, MP3 player, Portable Multimedia Player and also through Internet. Problem statement: The conventional algorithms such as DES and AES cannot be used directly in multimedia data, since multimedia data are repeatedly have high redundancy, large-volumes and require real-time operations, such as displaying, cutting, copying, bit-rate conversion … …Journal of Computer Science, Vol. 8, Issue 9 · 15 Aug 2012 · 7,694 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleFully Retroactive Priority Queues using Persistent Binary Search TreesJoseWagner de Andrade Junior, Rodrigo Duarte SeabraClassic dynamic data structures maintains itself subject to sequence S of operations and answer queries using the latest version of the data structure. Retroactive data structures are those which allow making a modification or a query in any version of this data structure through its timeline. These data structures are used in some geometric problems and in problems related with … …Journal of Computer Science, Vol. 16, Issue 7 · 14 Jul 2020 · 7,006 accessesView PDFCite
Research ArticleOpen accessIn the keywordsQuaternary Tree Structure as a Novel Method for Huffman Coding TreeAhsan Habib, Mohammed Jahirul Islam, Mohammad Shahidur RahmanThe binary code used by the current Huffman-based techniques slows down decoding speed. The quaternary Huffman coding method is a fresh take on the traditional Huffman coding that is suggested in this study. Each symbol is encoded into a quaternary code rather than a binary code using the quaternary Huffman coding technique. For Huffman coding, a quaternary code stream necessitates … …Journal of Computer Science, Vol. 19, Issue 9 · 24 Aug 2023 · 5,419 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA CONCEPTUAL FOUNDATION AND INTEGRATION DATABASE DESIGNING MODELMohamed Osman Ali HegaziThis study proposes a database designing model that works as a foundation for database designing phases and as integration for the database systems. The model starts by fragment the system from top to down and then integrate the different parts of the system using the bottom up approach. The proposed model is a graphic model, where it presents the fragmentations … …Journal of Computer Science, Vol. 10, Issue 3 · 21 Nov 2013 · 6,758 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSRBIR: Semantic Region Based Image Retrieval by Extracting the Dominant Region and Semantic LearningI. Felci Rajam, S. ValliProblem statement: The Semantic Region Based Image Retrieval (SRBIR) system that automatically segments the dominant foreground region, consisting of the semantic concept of the image, such as elephants, roses and does the semantic learning, is proposed. Approach: The system segments an image into different regions and finds the dominant foreground region in it, which is the semantic concept of that … …Journal of Computer Science, Vol. 7, Issue 3 · 7 Mar 2011 · 7,026 accessesView PDFCite
Research ArticleOpen accessIn the keywordsDevelopment of Deduced Protein Database Using Variable Bit Binary EncodingB. Parvathavarthini, B. Rajesh Kanna, L. RajeswarideviA large amount of biological data is semi-structured and stored in any one the following file formats such as flat, XML and relational files. These databases must be integrated with the structured data available in relational or object-oriented databases. The sequence matching process is difficult in such file format, because string comparison takes more computation cost and time. To reduce … …Journal of Computer Science, Vol. 4, Issue 6 · 30 Jun 2008 · 6,512 accessesView PDFCite
Research ArticleOpen accessIn the keywordsFast Approach to Factorize Odd Integers with Special DivisorsXingbo Wang, Junjian ZhongThe paper proves that an odd composite integer N can be factorized in O((log2N)4) bit operations if N = pq, the divisor q is of the form 2αu +1 or 2αu-1 with u being an odd integer and α being a positive integer and the other divisor p satisfies 1 …Journal of Mathematics and Statistics, Vol. 16, Issue 1 · 27 Jan 2020 · 7,436 accessesView PDFCite
Research ArticleOpen accessIn the keywordsHuffman Based Code Generation Algorithms: Data Compression PerspectivesAhsan Habib, M. Jahirul Islam, M. Shahidur RahmanThis article proposes two dynamic Huffman based code generation algorithms, namely Octanary and Hexanary algorithm, for data compression. Faster encoding and decoding process is very important in data compression area. We propose tribit-based (Octanary) and quadbit-based (Hexanary) algorithm and compare the performance with the existing widely used single bit (Binary) and recently introduced dibit (Quaternary) algorithms. The decoding algorithms for … …Journal of Computer Science, Vol. 14, Issue 12 · 9 Dec 2018 · 7,701 accessesView PDFCite