Dissertations/Theses - Department of Computer Science and Engineering: Recent submissions

  • New model for reliable web service 
    Maliha Sultana (Department of Computer Science and Engineering, BUET, 2007-09)
    In this thesis a new model for a distributed web service system is presented. The proposed " system is composed of multiple web service components having multiple alternative versions distributed among multiple servers. ...
  • Mining interesting rules from a large set of association rules 
    Sadi, Muhammad Sheikh (Department of Computer Science and Engineering, BUET, 2004-12)
    The goal of data mmmg IS to discover knowledge and reveal new, interesting and previously unknown information to the user. A central data-mining tool is association rules. This thesis work presents a constructive approach ...
  • Image compression using dynamic clustering and neural network 
    Yousuf Saber, Ahmed (Department of Computer Science and Engineering, BUET, 2002-10)
    In this thesis dynamic clustering and neural network techniques have been used for image compression. First we cluster the whole image dynamically up to an expected Peak Signal Noise Ratio (PSNR) and Mean Square Error ...
  • Real time soft shadow generation for arbitrary planar lights 
    Mushfiqur Rouf (Department of Computer Science and Engineering, BUET, 2007-08)
    Shadows are crucial for the human perception of the 3D world. Hard shadows are produced when a typical 011 definition of shadows is applied: if the light source can be seen from a pixel, it is lit; otherwise, it is in ...
  • Study on huffman coding 
    Nurul Huda, Mohammad (Department of Computer Science and Engineering, BUET, 2004-10)
    Since the discovery of the Huffman encoding scheme in 1952, Huffman codes have been widely used in the efficient storing of data, image and video. Huffman coding has been subjected to numerous investigations in the past ...
  • Scheduling of relay nodes in a heterogeneous wireless sensor network 
    Saber, Mohammad (Department of Computer Science and Engineering, BUET, 2009-10)
    Wireless sensor network is composed of large number of sensor nodes with limited battery power which cannot support long range communication. Sensor nodes' battery cannot be replaced due to adverse environment which ...
  • Scalable strorage in compressed representation for terabyte data management 
    Abdur Rouf, Mohammad (Department of Computer Science and Engineering, BUET, 2006-04)
    The emergence of e-application has been creating extremely high volume of data that reaches to terabyte threshold. Many'organizations are producing data that are doubling every year. The conventional data management ...
  • L-exclusion algorithm for mobile Ad Hoc networks 
    Salauddin Mohammad Masum (Department of Computer Science and Engineering, BUET, 2005-11)
    With the proliferation of portable computing platforms and small wireless devices, ad hoc mobile networks have received a substantial attention from the research community as a means for providing data communications ...
  • Pattern based object segmentation (POS) algorithm 
    Ziaul Karim, Md. (Department of Computer Science and Engineering, BUET, 2009-07)
    In the wake of increased use of multimedia applications for day-to-day normal activities, including business and entertainment, the pressure of introducing a generalized technique for segmenting an object in effective ...
  • Straight-Line grid drawings of planar graphs with sub-Quadratic area 
    Rezaul Karim, Md. (Department of Computer Science and Engineering, BUET, 2008-11)
    This thesis deals with area efficient straight-line drawings of planar graphs. It is well known that a planar graph of n vertices admits a straight-line grid drawing on a grid of area O(n2 ). A lower bound of n(n2) on ...
  • mPlexus : An efficient and scalable peer - to - peer routing protocol for queries with partial and misspelled keywords 
    Rakibul Haque, Md. (Department of Computer Science and Engineering, BUET, 2009-08)
    Efficiently searching is the vital operation in any Peer-to-Peer (P2P) network. Users may not know about the exact keywords of their requested files in such distributed systems which causes searching using partially ...
  • Multi-processor based heuristic for multidimensional multiple-choise knapsack problem 
    Abu Zafar Mohammad Shahriar (Department of Computer Science and Engineering, BUET, 2004-03)
    In this thesis we have devised a multi-processor based heuristic algorithm for the Multi-dimensional Multiple Choice Knapsack Problem (MMKP). MMKP is a variation of the classical 0-1 Knapsack Problem where there are ...
  • Linear time algorithms for floor-planning and routing problems 
    Azad, A. K. M. (Department of Computer Science and Engineering, BUET, 2005-08)
    The designer of an integrated circuit (IC) transforms a circuit description to a geometric description, called the VLSI layout. The task of converting the specification of an electrical circuit into a layout is called ...
  • Optimal contention window setting based on packet size distribution for error prone channel 
    Farah Tanjeem (Department of Computer Science and Engineering, 2014-09)
    Ad Hoc Network is a decentralized type of network where wireless devices are allowed to discover each other and communicate in peer to peer fashion without involving central access points. In most ad hoc networks, nodes ...
  • Agent-based model for malaria: examining the impact of existing and novel vector control interventions 
    Zahangir Alam, Md. (Department of Computer Science and Engineering, 2014-10)
    Malaria is a mosquito-borne infectious disease. It is transmitted among humans through female Anopheles mosquitoes. Anopheles vagus (in short An. vagus), one of the major mosquitoes (referred to as vectors in Malaria ...
  • Dynamic probabilistic broadcast for MANETs 
    Fatema Tuz Zohra (Department of Computer Science and Engineering, 2014-11)
    Self-pruning broadcasting algorithm exploits neighbor knowledge to reduce redundant retransmissions in mobile ad hoc wireless networks (MANETs). Although in self- pruning, only a subset of nodes forward the message based ...
  • Consensus string matching problem and the diagnosis of allelic heterogeneity 
    Fatema Tuz Zohora (Department of Computer Science and Engineering, 2014-10)
    The consensus problems in strings is motivated by the requirement of nding commonality of a large number of strings and has a variety of applications in Bioinformatics. This thesis presents important theoretical and ...
  • Protein folding in HP model on hexagonal prism lattice with diagonals 
    Shaw, Dipan Lal (Department of Computer Science and Engineering, 2014-09)
    The protein folding problem consist in nding the primary structure or native conformation of a protein from its amino acid sequence. It is one of the most studied computational problems in Bioinformatics and Computational ...
  • Approximation algorithms for protein folding in 2D lattice for the HP model 
    Sohidull Islam, A. S. M. (Department of Computer Science and Engineering, 2014-04)
    Three dimensional structure prediction of a protein from its amino acid sequence, known as protein folding, is one of the most studied computational problem in bioinformatics and computational biology. Since, this is a ...
  • On Pairwise Compatibility Graphs 
    Md. Shamsuzzoha Bayzid (Department of Computer Science and Engineering, 2010-06)
    This thesis deals with pairwise compatibility graphs. Let T be an edge weighted tree, let dT (u, v) be the sum of the weights of the edges on the path from u to v in T, and let dmin and dmax be two non-negative real ...

Search BUET IR


Advanced Search

Browse

My Account