DSpace Repository

Browsing Dissertation/Theses - Department of Computer Science and Engineering by Title

Browsing Dissertation/Theses - Department of Computer Science and Engineering by Title

Sort by: Order: Results:

  • 1-bend orthogonal drawings of triconnected planar 4-graphs 
    Abu Hasnat Mohammad Asfak Habib (Department of Computer Science and Engineering, BUET, 2007-10)
    An orthogonal drawing of a planar graph is a drawing of the graph in which each vertex is mapped to a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edges do not ...
  • Activity-aware ridesharing group trip planning queries for flexible poIs 
    Mahin, Mehnaz Tabassum (Department of Computer Science and Engineering, 2018-03-15)
    Ridesharing has become a popular model that enables users to share their rides with others in recent years. Traditional ridesharing services arrange ridesharing trips to travel between a xed source and a xed destination ...
  • Adaptive mobile notifications generation based on physical activities 
    Mobasshir Arshed Naved, Md. (Department of Computer Science and Engineering (CSE), 2016-09)
    Physical activity is an important factor that is considered for the prevention of diseases like diabetes or hypertension and for rehabilitation. Besides the advancement of technology and availability of smart-phones ...
  • 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 ...
  • Advanced DNA sequence compression algorithm 
    Sadia Sharmin (Department of Computer Science and Engineering, BUET, 2009-12)
    In this thesis we propose an advanced DNA sequence compression algorithm, which is efficient and lossless. None of the available general-purpose compression algorithm compresses these sequences. This is due to the ...
  • 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 ...
  • AHP and topsis based approach to solve student-supervisor assignment problem 
    Tasneem, Tamanna (Department of Computer Science and Engineering, 2021-11-20)
    The growing education sector of the current era offers a lot of choices and different paths for the students as well as for the educators. They now have a lot more opportunities to work with someone who has specific skills ...
  • Algorithm to extract rules from artificial neural networks 
    Kamruzzaman, S.M. (Department of Computer Science and Engineering, BUET, 2005-03)
    A new rule extraction algorithm, called rule extraction from artificial neural networks (REANN) is proposed and implemented to extract symbolic rules from ANNs. A standard three-layer feedforward ANN is the basis of the ...
  • Algorithmic framework based on the binarization approach for supervised and semi-supervised multiclass problems 
    Sen, Ayon (Department of Computer Science and Engineering (CSE), 2014-05)
    Using a set of binary classi ers to solve the multiclass classi cation problem has been a popular approach over the years. This technique is known as binarization. The decision boundary that these binary classi ers (also ...
  • Algorithms and program modules for processing interrelated information cells 
    Ashraf Habib Rumi (Department of Computer Science and Engineering, BUET, 1986-12)
    The present research work has undertaken the task of developing algorithms and software programs for processing a large number of information cells containing high level program statements including assignments, arithmetic ...
  • Algorithms for bar 1-visibility representations of graphs 
    Shaheena Sultana (Department of Computer Science and Engineering (CSE), 2011-09)
    A bar visibility representation of a planar graph G is a drawing of G where each vertex is drawn as a horizontal line segment called bars, each edge is drawn as a vertical line segment where the vertical line segment ...
  • Algorithms for constructing multi-labeled phylogenetic trees from quartets with fewer leaf duplications 
    Rahman, Md. Mizanur (Department of Computer Science and Engineering, 2017-11-12)
    A central problem in computational and evolutionary biology is the inference of phylogenetic tree from a set of triplets or quartets. Researchers try to construct phylogenetic tree by com¬bining many triplets or quartets ...
  • Algorithms for minimizing systemic risks in complex systems with guided network topology 
    Das, Sujoy (Department of computer Science and Engineering, 2022-03-01)
    The topological characteristics of the underlying network of a system are very important to study and analyze the system. The mode of interaction among the components of a system may introduce many kinds of systemic risks. ...
  • Algorithms for minimum length sliding camera problem 
    AlMahmud, Mohammad (Department of Computer Science and Engineering (CSE), 2016-02)
    Art gallery problem is a well known visibility problem where objective is to cover the whole gallery by the minimum number of cameras. In computa- tional geometry galleries are represented by two dimensional ...
  • Algorithms for polyline drawings of plane 3-trees 
    Hussain, Md. Khaled (Department of computer Science and Engineering, 2019-03-30)
    This thesis deals with polyline grid drawings of planar graphs. A polyline drawing of a planar graph is a drawing of the graph where each vertex is drawn on a grid point and each edge is drawn by a polygonal chain. A point ...
  • Algorithms for r-gathering and r-gather clustering problems 
    Ahmed, Shareef (Department of computer Science and Engineering, 2019-03-28)
    Given a set of customers C, a set of proposed facilities F , an opening cost op(f ) of each facility f ∈ F and a cost function cost(c, f ) for each c ∈ C and f ∈ F , the facility location problem asks to find an assignment ...
  • Analysing developers' sentiments of code reviews an empirical study 
    Toufique Ahmed (Department of Computer Science and Engineering (CSE), 2016-12)
    The sentiment (i.e., general positive or negative attitude) towards another person, entity or event significantly influences a person’s decision-making process. It is one of the most important factors that influences ...
  • Analytical solution of queues in the node interfaces for computer networks 
    Abu sayed Md. Latiful Hoque (Department of Computer Science and Engineering, BUET, 1991-12)
    For abstracts please see full text
  • Analyzing adversary capability for subset coding based privacy protection in participatory sensing 
    Zaman, Shaolin (Department of computer Science and Engineering, 2019-09-19)
    With the growth of network communication across the world, Participatory Sensing Sys-tem (PSS) is being acknowledged as an emerging technology given its potential for a wide variety of sensing applications. As the participation ...
  • Approximation algorithm for edge-ranking of series-parallel graphs 
    Tanzima Hashem (Department of Computer Science and Engineering, BUET, 2006-06)
    This thesis deals with an approximation algorithm for finding edge-rankings of series-parallel graphs. An edge-ranking of a graph G is a labeling of its edges with positive integers such that every path between two edges ...

Search BUET IR


Advanced Search

Browse

My Account