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:

  • Efficient algorithm for edge-ranking of series-parallel graphs 
    Zakir Hossain, Md. (Department of Computer Science and Engineering, BUET, 1999-12)
    For abstracts please see full text
  • An efficient algorithm l-vertex-coloring of partial k-trees 
    Ibrahim Khan, Mohammad (Department of Computer Science and Engineering, BUET, 2002-10)
    This thesis presents an efficient algorithm for finding an optimal I-vertex-coloring of a partial k-tree. An I-vertex-coloring of a graph G is defined as follows: for a positive integer I and a graph G with non-negative ...
  • Efficient algorithms for community aware ridesharing group set queries 
    Nabila, Shuha (Department of Computer Science and Engineering (CSE), 2022-11-12)
    Abstract Ridesharing services have been becoming aprominent solution to reduce the road trafficcongestionandenvironmentalpollutioninurbanareas.Existingridesharing servicesfallapartinensuringbothfairnessandthesocialc ...
  • Efficient algorithms for computing optimal meeting points in the obstructed space 
    Hashem, Tahsina (Department of Computer Science and Engineering, 2017-12-03)
    In this thesis, we introduce an Obstructed Optimal M eeting P oint (OOMP) query that enables a group of users to identify a meeting location with the minimum total travel distance in presence of obstacles. For example, a ...
  • 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 ...
  • Efficient algorithms for geometric representations of graphs 
    Sultana, Shaheena (Department of Computer Science and Engineering, 2018-02-28)
    Agraphconsistsofasetofverticesandasetofedges,eachjoiningtwovertices.Age-ometricrepresentationofagraphisarepresentationofthegraphinwhichtheverticesandedgesarerepresentedbygeometricobjects.Visibilityrepresentations,orthogo ...
  • Efficient and effective interactive hierarchical document organization of text databases 
    Pallabi Parveen (Department of Computer Science and Engineering, BUET, 2001-08)
    For abstracts please see full text
  • Efficient approach for finding common DNA motifs with gaps 
    Sayeed, Suri Dipannita (Department of computer Science and Engineering, 2019-07-09)
    Motifs are repeated patterns in groups of protein or nucleic acid sequences and motif discovery is an important and challenging problem in computational biology. This thesis formulates the gapped motif finding problem as ...
  • Efficient computation of safest nearby neighbors in road networks 
    Biswas, Punam (Department of computer Science and Engineering, 2021-10-27)
    Traditional route planning and k nearest neighbors queries only consider distance or travel time and ignore road safety altogether. However, many travellers prefer to avoid risky or unpleasant road conditions such as roads ...
  • Efficient information retrieval system for Bangla text database 
    Amir Sharif, Mohammad (Department of Computer Science and Engineering, BUET, 2006-11)
    The amount of information available in electronic form is growmg exponentially, making it increasingly difficult to find the desired information. Information retrieval is primarily conccrned with the storage and retrieval ...
  • Efficient multi-hop sybil-resilient DHT 
    Tanvir Al Amin, Md. (Department of Computer Science and Engineering (CSE), 2011-05)
    DHTs (Distributed Hash Tables) are data structures over an overlay network, implement- ing e cient insert and lookup of key-value pairs in a decentralized manner. DHTs are subject to the well-known Sybil attack, where ...
  • Efficient parallel algorithms for ranking of trees 
    Ziaur Rahman, Mohammad (Department of Computer Science and Engineering, BUET, 2000-01)
    For abstracts please see full text
  • Efficient processing of maximum visibility facility selection query in spatial databases 
    Ishat - E - Rabban, Md. (Department of Computer Science and Engineering, 2017-06-21)
    The widespread availability of realistic 3D models of cities, buildings etc. provides an op- portunity to answer many real-life queries involving visibility in the presence of 3D obstacles. For example, ”Where to place ...
  • Efficient processing of optimal obstructed sequenced route queries 
    Anwar, Anika (Department of Computer Science and Engineering, 2017-12-06)
    Trip planning has become an important class of location-based services (LBSs) in recent years thatenable users to plan trips for visiting different points of interests (POIs) like a restaurant, a shoppingcenter and a movie ...
  • Efficient technique for online crowdshipping based package delivery with daily commuters 
    Eusuf, Shadman Saqib (Department of Computer Science and Engineering (CSE), 2022-11-29)
    Theadvancementoflocation-awaretechnologiesenablesgeneratinganunprecedented amount of trajectories representing the daily commuting patterns ofdwellers in a city. A wide variety of location-based services have started ...
  • Efficient techniques for privacy preserved incremental record linkage of noisy health data 
    Shahidul Islam Khan (Department of Computer Science and Engineering(CSE), BUET, 2020-02-29)
    Atpresentmanypublicandprivateorganizationscollecthugeamountofdata.Later,thesedataare processed and analyzed to discover interesting knowledge that support proper decision making. Developingefficienttechniquesforcleaningan ...
  • Energy aware target tracking in underwater wireless sensor networks (UWSNs) 
    Nazia Majadi (Department of Computer Science and Engineering (CSE), 2012-10)
    Tracking targets in Underwater Wireless Sensor Networks (UWSNs) is more challenging than the terrestrial Wireless Sensor Networks (WSNs) because in an UWSN, Radio Frequency (RF) communication is not possible and acoustic ...
  • Energy efficient broadcasting in wireless Ad hoc networks 
    Anindya Iqbal (Department of Computer Science and Engineering, BUET, 2009-03)
    Energy efficiency is a key issue in research area of wirc1ess,ad hoc and sensor network. Many wireless applications are inherently broadcasting based and here the energy consumption issue becomes even 'more pronounced. ...
  • Energy efficient gravitational model for tree based routing in wireless sensor networks 
    Rahman, Md Mahbubur (Department of Computer Science and Engineering, 2018-03-28)
    Wireless Sensor Networks (WSNs) are widely used for gathering data from heterogeneous environments. Reduction of energy consumption is a key factor for WSN to maximize the network lifetime. A mobile sink with WSN is very ...
  • Energy efficient zone based data gathering approach in wireless sensor networks 
    Abu Sayed Chowdhury (Department of Computer Science and Engineering (CSE), 2012-09)
    Wireless sensor network (WSN) technology is one of the popular applied tech- nologies due to its various applications. Data collection or data gathering is a vital part of WSN. To make the network workable and to maintain ...

Search BUET IR


Advanced Search

Browse

My Account