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

  • Novel block matching algorithm for motion vector estimation 
    Abedul Haque, Md. (Department of Computer Science and Engineering, BUET, 2008-06)
    Motion vector estimation IS the most computationally expensive activity In video compression. Researchers have been trying to develop efficient searching algorithms for long time. In this thesis, we have developed a novel ...
  • Novel approach to cluster heterogeneous sensor network (CHSN) 
    Alim Al Islam, A . B . M . (Department of Computer Science and Engineering, BUET, 2009-05)
    Network lifetime is one of the important metrics in performance evaluation of sensor network. It depends on both the rate of energy consumption and the relative distribution of the energy consumption among the sensor ...
  • QoS support for multimedia sessions in the Diffserv-Aware ATM based MPLS network 
    Ali, Mohammad (Department of Computer Science and Engineering, BUET, 2004-04)
    Communication links with high data throughput capacity (bandwidth) and low latency are the prime requirements to support multimedia applications such as voice on demand services, video conferencing and virtual reality. ...
  • Practically efficient algorithms for minimum string cover and minimum common string partition problem 
    Ferdous, S.M. (Department of Computer Science and Engineering, BUET, 2014-03)
    Covering and Partitioning problems are very important problems in computer science. Both of them deal with combinatorial structure of the instances. In covering problem the question is whether a certain combinatorial ...
  • Spanning paths, cycles and trees: problems and results 
    Sohel Rahman, Mohammad (Department of Computer Science and Engineering, BUET, 2004-01)
    This thesis deals with the classical graph theoretic structures- spanning paths, cycles and trees. We here present new sufficient conditions for a graph to possess Hamiltonian (spanning) paths. New sufficient conditions ...
  • Dynamic adaptive content delivery using genetic algorithm 
    Maksud Hossain, Mohammad (Department of Computer Science and Engineering, BUET, 2009-09)
    In this thesis a new framework for dynamic adaptive content delivery is presented, which is suitable for diversified mobile devices. The proposed framework can dynamically adapt itself for diversified web contents available ...
  • Neural network model for invariant pattern recognition 
    Monirul Islam, Md. (Department of Computer Science and Engineering, BUET, 1996-04)
    A pattern recognition system using Artificial Neural Network (ANN) classifier is proposed. The system is intended to recognize translated, rotated aod scaled versions of the exemplar patterns. The model proposed for this ...
  • Low complexity task scheduling for large scale homogeneous and heterogeneous parallel processors 
    Maruf Ahmed (Department of Computer Science and Engineering, BUET, 2008-06)
    A distributed memory system can take advantage of fast communication networks to achieve phenomenal computing power. One of the important problems of distributed memory systems is the task scheduling problem, which ...
  • Design of non-ambiguous predictive parser for Bangla natural language sentence with error recovery capability 
    Fazle Elahi Faisal (Department of Computer Science and Engineering, BUET, 2008-12)
    Machine translation from Bangia to other languages is a promising field, but there are limited works in this area. Syntax-based machine translation is a suitable technique for machine translation system from Bangia to ...
  • Multimedia database indexing 
    Mahboob Karim, Md. (Department of Computer Science and Engineering, BUET, 2001-10)
    Multimedia Database maintenance, manipulation and storage on the web is very expensive and. inefficient both in terms of space and time. Lot of researches are going on all around to develop a handsome and effective ...
  • Expert system assisting decision-making at LDC for the national electrical grid faults 
    Anisur Rahman, Md. (Department of Computer Science and Engineering, BUET, 1990-08)
    Artificial Intelligence has undergone tremendous development as well as revolutionary chaMge in computer science since its birth at Dartmouth college, USA in 1966. As a result of these development, Expert systems have ...
  • New dynamic service span based energy comparison LEACH for achieving expected network lifetime 
    Akramul Azim (Department of Computer Science and Engineering, BUET, 2009-08)
    Prolonging the lifetime of a sensor node powered by the battery in homogeneous wireless sensor networks (WSNs) is a very popular research area now-a-days. Many research works including low energy adaptive clustering ...
  • Distributed optimized resource reservation scheme for grid computing 
    Rifat Shahriyar (Institute of Information and Communication Technology, BUET, 2009-12)
    The idea of grid computing originated in the scientific community and was initially motivated by processing power and storage intensive applications. The basic objective of grid computing is to support resource sharing ...
  • Synthesis of substituted indoles by metal mediated reactions 
    Ismail Hossain, Mohammad (Department of Chemistry , BUET, 2009-08)
    In view of the extensive natural occurrence and biological importance of the indole nucleus containing heterocyclic compounds a general and facile method for the synthesis of indole derivatives through palladium catalyzed ...
  • Parsing methodology for Bangla natural language sentences 
    Moshiul Hoque, Mohammad (Department of Computer Science and Engineering, BUET, 2005-07)
    The research described in this thesis aims at the design and implementation of a parsing methodology for Bangia natural language sentences that is used as part of a BangIa to English machine translation system. Specifically, ...
  • Parallel algorithm for optimum vertex-rankings of permulation graphs 
    Abdul Hakim Newton, Muhammad (Department of Computer Science and Engineering, BUET, 2002-10)
    In this thesis, we give a parallel algorithm to find the c-vertex-ranking of a permutation graph. A c-vertex-ranking of a graphG = (V,E), for a positive integer c, is a labeling of the vertices of G such that, for any ...
  • Admission control of multimedia sessions to a set of multimedia servers connected through an enterprise network 
    Monirul Islam, Md. (Department of Computer Science and Engineering, BUET, 2004-12)
    Multimedia transmission requires timely and ordered delivery of data with possibly no retransmission. As the number of users of multimedia applications is increasing day by day, overloaded servers and network congestion ...
  • Minimum segment drawings of outerplanar graphs 
    Abdullah Adnan, Muhammad (Department of Computer Science and Engineering, BUET, 2008-12)
    In a straight line drawing of a planar graph each vertex is drawn as a point and each edge is drawn as a straight line segment. One of the important aesthetic criteria for a straight line drawing is to minimize the number ...
  • New equiprojective polyhedra from tetrahedron and some generalized Johnson solids 
    Monoar Hossain, Mohammad (Department of Computer Science and Engineering, BUET, 2008-11)
    A polyhedron is called equiprojective, if from any direction the size of the projection boundary is fixed, where the size means the nurnber of vertices or edges. In this thesis, construction of equiprojeetive polyhedra ...
  • Indexing of extensible markup language data using a two dimensional bitmap 
    Monjurul Alom, B.M. (Department of Computer Science and Engineering, BUET, 2005-11)
    Extensible Markup Language (XML) is a standard for representing and exchanging information on the Internet. Storing and querying of XML data has created new challenges for conventional relational database management ...

Search BUET IR


Advanced Search

Browse

My Account