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

  • Design and development of a bangla spell checker 
    Tamjidul Hoque, Md. (Department of Computer Science and Engineering, BUET, 2002-07)
    This research work has been aimed at designing and developing a BangIa Spell Checker. Use of different forms of same letter with different set of rules in BangIa, makes the straightforward development of the BangIa Speller ...
  • Multicast video-on-demand service in enterprise networks with client assisted patching 
    Farhad, S.M. (Department of Computer Science and Engineering, BUET, 2007-09)
    Multicast Video-on-Demand (VoD) systems are scalable and cheap-to-operate. In such systems, a single stream is shared by a batch of common user requests. In this research, we adapt multicast communication technique in ...
  • Efficient algorithms for generating all triangulations of plane graphs 
    Tanvir Parvez, Mohammad (Department of Computer Science and Engineering, BUET, 2006-03)
    Generating all triangulations of graphs and polygons have many applications in Computational Geometry, VLSI Floorplaning and Graph Drawing. In this thesis, we deal with the problem of generating all triangulations of ...
  • Intelligent dynamic spectrum access exploiting a synergy between genetic algorithm and local search 
    Jahidul Islam, Md. (Department of Computer Science and Engineering, 2015-02)
    This thesis presents a novel hybrid dynamic spectrum access technique for multi-channel single-radio cognitive radio networks. Existing classical and stochastic approaches exhibit di erent advantages and disadvantages ...
  • Voronoi neighbors: optimization, variation and games 
    Muhibur Rasheed, Md. (Department of Computer Science and Engineering, BUET, 2008-07)
    Recently several researchers have formulated the competitive facility location problem through Voronoi diagrams where a new site is placed in such a location that its Voronoi region is maximized. One notable result gives ...
  • New correlation based pruning algorithm for designing artificial neural networks 
    Suman Ahmmed (Department of Computer Science and Engineering, BUET, 2006-02)
    Artificial neural networks (ANNs) are complex and useful problem solvers. Architecture determination of ANN is an important issue for the successful application of ANNs in many practical problems. It is well known that ...
  • Data compression techniques for Bangla text 
    Humayun, S.M. (Department of Computer Science and Engineering, BUET, 1994-08)
    In recent years BangIa has been being used in computers. For efficient use of this language in computers it is very important to be able to store texts economically so that in terms of both storage requirement and ...
  • Cooperative coevolution of multi-agent systems: demonstrated in prey capture task 
    Shohrab Hossain, Md. (Department of Computer Science and Engineering, BUET, 2007-01)
    The basic principles of evolution have been applied to the solution of technical problems in a wide range of domains. To successfully apply evolutionary algorithms to these increasingly complex problems, we must develop ...
  • New local search based ACO algorithm for solving combinatorial optimization problems 
    Rakib Hassan, Md. (Department of Computer Science and Engineering, BUET, 2007-06)
    ACO algorithms are a new branch of swarm intelligence. ACO algorithms have been introduced in the last decade. They have been applied to solve different combinatorial optimization problems successfully. Their performance ...
  • 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 ...

Search BUET IR


Advanced Search

Browse

My Account